|
| |
|
|
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.
|
|
9
|
|
|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
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. 117521), 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
|
|
|
LINKS
|
Table of n, a(n) for n=1..93.
N. J. A. Sloane, Sequences of RADD type
|
|
|
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: A067169 A011339 A166243 * A190544 A172293 A161970
Adjacent sequences: A118511 A118512 A118513 * A118515 A118516 A118517
|
|
|
KEYWORD
|
nonn,base
|
|
|
AUTHOR
|
N. J. A. Sloane, May 06 2006
|
|
|
STATUS
|
approved
|
| |
|
|
