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

 

Logo
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

%I #6 May 26 2014 23:48:48

%S 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,

%T 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,

%U 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

%N 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.

%H N. J. A. Sloane and others, <a href="/wiki/Sequences_of_RADD_type">Sequences of RADD type</a>, OEIS wiki.

%Y For records see A118510. Cf. A117831. S_1 is A117230, S_11 is A118512, S_13 is A118513.

%K nonn,base

%O 1,11

%A _N. J. A. Sloane_, May 06 2006

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 30 09:09 EDT 2024. Contains 372131 sequences. (Running on oeis4.)