|
|
A065216
|
|
Eleven 'Reverse and Add' steps are needed to reach a palindrome.
|
|
3
|
|
|
167, 266, 365, 563, 662, 761, 860, 7069, 7159, 7249, 7339, 7429, 7519, 7609, 7699, 7789, 7879, 7969, 8068, 8158, 8248, 8428, 8518, 8608, 8698, 8788, 8878, 8968, 9039, 9067, 9129, 9157, 9219, 9247, 9309, 9337, 9399, 9427, 9489, 9517, 9579, 9607, 9697
(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, 12]] == 12; Select[Range[1000], lenQ] (* Vincenzo Librandi, Sep 24 2013 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|