The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A118511 Define sequence S_n by: initial term = n, reverse digits and add 1 to get next term. It is conjectured that S_n always reaches a cycle of length 9, as in A117230. Sequence gives number of steps for S_n to reach the cycle. 2
 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 18, 17, 15, 13, 11, 9, 7, 5, 3, 1, 16, 16, 15, 13, 11, 9, 7, 5, 3, 1, 14, 14, 14, 13, 11, 9, 7, 5, 3, 1, 12, 12, 12, 12, 11, 9, 7, 5, 3, 1, 10, 10, 10, 10, 10, 9, 7, 5, 3, 1, 8, 8, 8, 8, 8, 8, 7, 5, 3, 1, 6, 6, 6, 6, 6, 6, 6, 5, 3, 1, 4, 4, 4, 4, 4, 4, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,11 LINKS N. J. A. Sloane and others, Sequences of RADD type, OEIS wiki. CROSSREFS For records see A118510. Cf. A117831. S_1 is A117230, S_11 is A118512, S_13 is A118513. Sequence in context: A070646 A094381 A074972 * A022974 A023460 A029926 Adjacent sequences:  A118508 A118509 A118510 * A118512 A118513 A118514 KEYWORD nonn,base AUTHOR N. J. A. Sloane, May 06 2006 STATUS approved

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

Last modified April 7 15:56 EDT 2020. Contains 333306 sequences. (Running on oeis4.)