This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A118510 Define sequence S_m by: initial term = m, reverse digits and add 1 to get next term. It is conjectured that S_m always reaches a cycle of length 9, as in A117230. Sequence gives records for number of steps to reach cycle. 4

%I

%S 1,18,19,36,37,54,55,72,73

%N Define sequence S_m by: initial term = m, reverse digits and add 1 to get next term. It is conjectured that S_m always reaches a cycle of length 9, as in A117230. Sequence gives records for number of steps to reach cycle.

%C The values of m which take this many steps are 1, 11, 101, 1001, 10001, 100001, 1000001, 10000001, 100000001, ...

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

%F a(n) = 1 + 9*(n-1) for odd n; a(n) = 9*n for even n. Recursion: a(1) = 1; a(2) = 18; a(n+1) = a(n-1) + 18. - (Klaus Brockhaus, Jul 28 2006)

%Y Records in A118511.

%Y Cf. A117230, A117831, A118473, A118474.

%K nonn,base

%O 1,2

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

%E a(5) to a(9) from _Klaus Brockhaus_, Jul 28 2006

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 May 19 02:29 EDT 2019. Contains 323377 sequences. (Running on oeis4.)