|
|
A015991
|
|
Numbers such that ten iterations of Reverse and Add are needed to reach a palindrome.
|
|
1
|
|
|
829, 928, 9059, 9149, 9239, 9329, 9419, 9509, 9599, 9689, 9779, 9869, 9959, 10634, 10637, 10687, 10716, 10808, 10834, 10838, 10867, 10873, 10898, 10927, 10979, 11398, 11624, 11627, 11677, 11706, 11824, 11828, 11857, 11863, 11888
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
The number of iterations starts at 1, so palindromes (cf. A002113) are not excluded. The corresponding sequence excluding palindromes is A065215.
|
|
LINKS
|
|
|
MATHEMATICA
|
tiraQ[n_]:=Rest[Boole[PalindromeQ/@NestList[#+IntegerReverse[#]&, n, 10]]]=={0, 0, 0, 0, 0, 0, 0, 0, 0, 1}; Select[Range[12000], tiraQ] (* Harvey P. Dale, May 11 2019 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|