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

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, 100

Offset: 0

Author

Sebastian Karlsson, Nov 17 2021

Keywords

• nonn
• base
• look

Comments

First differs from A348179 at a(101).

Examples

			a(3210) = 2020, because:
Moving 3 steps to the left from 3 gives: 3 -> 0 -> 1 -> 2.
Moving 2 steps to the left from 2 gives: 2 -> 3 -> 0.
Moving 1 step to the left from 1 gives: 1 -> 2.
Moving 0 steps to left from 0 gives: 0.
		

Links

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

Crossrefs

Cf. A336668 (fixed points), A348179 (to the right).

Cf. A139337, A346576, A347323.

Programs

Haskell

import Data.Char (digitToInt)
a n = read [s !! mod (i - digitToInt (s !! i)) l | i <- [0..l-1]] :: Integer
    where s = show n; l = length s

PARI

a(n) = { my (d=digits(n)); fromdigits(vector(#d, k, d[1+(k-1-d[k])%#d])) } \\ Rémy Sigrist, Nov 17 2021

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)))