A348179 Replace each decimal digit d of n with the digit that is d steps to the right of d. Interpret the digits of n as a cycle: one step to the right from the last digit is considered to be the first.

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 11, 22, 31, 44, 51, 66, 71, 88, 91, 20, 22, 22, 22, 24, 22, 26, 22, 28, 22, 0, 13, 22, 33, 44, 53, 66, 73, 88, 93, 40, 44, 42, 44, 44, 44, 46, 44, 48, 44, 0, 15, 22, 35, 44, 55, 66, 75, 88, 95, 60, 66, 62, 66, 64, 66, 66, 66, 68, 66, 0, 17, 22, 37, 44, 57, 66, 77, 88, 97, 80, 88, 82, 88, 84, 88, 86, 88, 88, 88, 0, 19, 22, 39, 44, 59, 66, 79, 88, 99, 0, 1

Offset

0,3

Comments

First differs from A349422 at a(101). - Sebastian Karlsson, Dec 31 2021

Links

Sebastian Karlsson, Table of n, a(n) for n = 0..10000

Example

a(102345) = 004124 = 4124. For example, 4 gets replaced by 2 because moving 4 steps to the right gives: 4 -> 5 -> 1 -> 0 -> 2. Note that from 5 we went to the first digit of the number.

Mathematica

Table[FromDigits@Table[v[[If[(p=Mod[k+v[[k]], t])==0, t, p]]], {k, t=Length[v=IntegerDigits[n]]}], {n, 0, 67}] (* Giorgos Kalogeropoulos, Oct 08 2021 *)

Prog

(Haskell)
import Data.Char (digitToInt)
a n = let s = show n; l = length s in
  read [s !! (mod (i + digitToInt (s !! i)) l) | i <- [0..l-1]] :: Integer
(Python)
def a(n):
    s, l = str(n), len(str(n))
    return int("".join(s[(i + int(s[i])) % l] for i in range(l)))
(PARI) f(k, d) = d[(k+d[k]-1)%#d + 1];
a(n) = my(d=digits(n), dd=vector(#d, k, f(k, d))); fromdigits(dd); \\ Michel Marcus, Oct 07 2021

Crossrefs

Cf. A336668 (fixed points), A349422 (to the left), A349423 (index of first appearance of n).

Cf. A106649, A139337, A322131, A339023, A341767, A341953, A346576, A347323.

Sequence in context: A256754 A265525 A355223 * A349422 A056967 A321243

Adjacent sequences: A348176 A348177 A348178 * A348180 A348181 A348182

Keyword

nonn,base,look

Author

Sebastian Karlsson, Oct 05 2021

Extensions

a(68)-a(101) from Sebastian Karlsson, Dec 31 2021

Status

approved