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!)
A222533 Smallest palindrome which requires at least n iterations of Reverse and Add to reach a palindrome. 1
1, 5, 77, 181, 747, 88, 494, 292, 4664, 9779, 464, 10901, 4884, 1991, 474, 999, 838, 64946, 989, 448844, 48084, 99199, 484, 73137, 48184, 94149, 11911, 390093, 46264, 567765, 26262, 28782, 3541453, 831138, 1447441, 493394, 1309031, 46664, 8817188, 17871 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Palindromes themselves are also 'Reverse and Add!'ed!
LINKS
Arkadiusz Wesolowski, Table of n, a(n) for n = 1..110
Eric Weisstein's World of Mathematics, Reverse-Then-Add Sequence
MATHEMATICA
lst = {}; rev[n_] := FromDigits@Reverse@IntegerDigits[n]; testQ[n_] := ! rev[n] == n; Do[n = 1; While[True, If[! testQ[n], p = n + rev[n]; If[Length@TakeWhile[NestList[# + rev[#] &, p, s - 1], testQ] == s - 1, AppendTo[lst, n]; Break[]]]; n++], {s, 40}]; lst
CROSSREFS
Sequence in context: A319186 A076215 A202607 * A059856 A001513 A028556
KEYWORD
base,nonn
AUTHOR
STATUS
approved

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 July 24 13:53 EDT 2024. Contains 374584 sequences. (Running on oeis4.)