|
|
A065213
|
|
Eight 'Reverse and Add' steps are needed to reach a palindrome.
|
|
3
|
|
|
193, 391, 490, 589, 688, 886, 985, 1993, 1995, 2994, 3991, 4990, 4992, 5991, 6990, 8059, 8149, 8239, 8329, 8419, 8509, 8599, 8689, 8779, 8869, 8959, 9058, 9069, 9089, 9148, 9159, 9179, 9238, 9249, 9269, 9328, 9359, 9418, 9429, 9508, 9519, 9539, 9598
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
The number of steps starts at 0, so palindromes (cf. A002113) are excluded.
|
|
LINKS
|
|
|
MATHEMATICA
|
lenQ[n_]:=Length[NestWhileList[#+FromDigits[Reverse[IntegerDigits[#]]]&, n, #!=FromDigits[Reverse[IntegerDigits[#]]]&, 1, 10]]==9; Select[Range[ 10000], lenQ] (* Harvey P. Dale, Aug 09 2013 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|