login
This site is supported by donations to The OEIS Foundation.

 

Logo


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
1, 18, 19, 36, 37, 54, 55, 72, 73 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

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

LINKS

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

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

FORMULA

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)

CROSSREFS

Records in A118511.

Cf. A117230, A117831, A118473, A118474.

Sequence in context: A095393 A301601 A056022 * A022108 A041654 A041656

Adjacent sequences:  A118507 A118508 A118509 * A118511 A118512 A118513

KEYWORD

nonn,base

AUTHOR

N. J. A. Sloane, May 06 2006

EXTENSIONS

a(5) to a(9) from Klaus Brockhaus, Jul 28 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 04:00 EDT 2019. Contains 322406 sequences. (Running on oeis4.)