The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 4
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS First differs from A348179 at a(101). LINKS Sebastian Karlsson, Table of n, a(n) for n = 0..10000 EXAMPLE 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. PROG (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 (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) a(n) = { my (d=digits(n)); fromdigits(vector(#d, k, d[1+(k-1-d[k])%#d])) } \\ Rémy Sigrist, Nov 17 2021 CROSSREFS Cf. A336668 (fixed points), A348179 (to the right). Cf. A139337, A346576, A347323. Sequence in context: A265525 A355223 A348179 * A056967 A321243 A067079 Adjacent sequences: A349419 A349420 A349421 * A349423 A349424 A349425 KEYWORD nonn,base,look AUTHOR Sebastian Karlsson, Nov 17 2021 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 26 15:19 EDT 2023. Contains 365660 sequences. (Running on oeis4.)