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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A023109 Smallest number which requires exactly n iterations of Reverse and Add to reach a palindrome. 23
0, 10, 19, 59, 69, 166, 79, 188, 193, 1397, 829, 167, 2069, 1797, 849, 177, 1496, 739, 1798, 10777, 6999, 1297, 869, 187, 89, 10797, 10853, 10921, 10971, 13297, 10548, 13293, 17793, 20889, 700269, 106977, 108933, 80359, 13697, 10794, 15891, 1009227, 1007619, 1009246, 1008628, 600259, 131996, 70759, 1007377, 1001699, 600279, 141996, 70269, 10677, 10833, 10911 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

LINKS

Jason Doucette, World Records

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

Index entries for sequences related to Reverse and Add!

CROSSREFS

Cf. A033665, A006960.

Sequence in context: A088409 A065198 A033866 * A146091 A007811 A166706

Adjacent sequences:  A023106 A023107 A023108 * A023110 A023111 A023112

KEYWORD

nonn,base,nice

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

EXTENSIONS

Verified and added terms 1009227-10911 by Aldo González Lorenzo, May 15 2011.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 21:56 EST 2012. Contains 205860 sequences.