A118514 Define sequence S_n by: initial term = n, reverse digits and add 2 to get next term. It is conjectured that S_n always reaches a cycle. Sequence gives number of steps for S_n to reach a cycle.

1, 3, 0, 2, 0, 1, 0, 0, 0, 0, 0, 9, 0, 7, 10, 0, 9, 4, 0, 3, 8, 8, 8, 7, 15, 5, 5, 3, 12, 1, 11, 16, 0, 7, 0, 5, 8, 0, 7, 2, 0, 6, 6, 6, 6, 5, 13, 3, 3, 1, 10, 6, 9, 14, 0, 5, 0, 3, 6, 0, 5, 4, 0, 4, 4, 4, 4, 3, 11, 1, 1, 13, 8, 4, 7, 12, 0, 3, 0, 1, 4, 2, 3, 2, 0, 2, 2, 2, 2, 1, 9, 12, 0

Offset

1,2

Comments

Initial cycles have length 81 or 90.

There is one cycle of length 81 (least component is 3, all components have at most three digits, cf. A117521), 22 cycles of length 90 with 4-digit components (least components are 1013 + 2*k for k = 0, ..., 21, cf. A120214) and one cycle of length 45 with 4-digit components (least component is 1057, cf. A120215). Furthermore there are 22 cycles of length 1890 (least components are 100013 + 2*k for k = 0, ..., 21, cf. A120216), one cycle of length 945 (least component is 100057, cf. A120217) and 225 cycles of length 900 (least components are 100103 + 2*k for k = 0, ..., 224, cf. A120218), all having 6-digit components. It is conjectured that there are also cycles of increasing length with 8-, 10-, 12-, ... digit components. - Klaus Brockhaus, Jun 10 2006

From Michael S. Branicky, May 11 2023: (Start)

There are 22 cycles of length 19890 (least components are 10000013 + 2*k for k = 0, ..., 21), one cycle of length 9945 (least component 10000057), 225 cycles of length 18900 (least components are 10000103 + 2*k for k = 0, ..., 224) and 2250 cycles of length 9000 (least components are 10001003 + 2*k for k = 0, ..., 2249), all having 8-digit components.

These patterns continue. Specifically, there is one cycle of length 10^(n/2) - 55 (least component 10^(n-1) + 57), and there are 22 cycles of length 2*(10^(n/2) - 55) (least components 10^(n-1) + 13 + 2*k for k = 0, ..., 21), each for n = 4, 6, 8, 10, 12, 14, 16. (End)

Links

Table of n, a(n) for n=1..93.

Michael S. Branicky, Python program for OEIS A118514, A118515, and A118516

N. J. A. Sloane and others, Sequences of RADD type, OEIS wiki.

Prog

(Python) # see linked program

Crossrefs

For records see A118515, A118516. Cf. A117831. S_1 is A117521.

S_1013 is A120214, S_1057 is A120215, S_100013 is A120216, S_100057 is A120217, S_100103 is A120218.

Sequence in context: A257927 A011339 A166243 * A190544 A172293 A353461

Adjacent sequences: A118511 A118512 A118513 * A118515 A118516 A118517

Keyword

nonn,base

Author

N. J. A. Sloane, May 06 2006

Status

approved