[go: up one dir, main page]

login
Search: a015991 -id:a015991
     Sort: relevance | references | number | modified | created      Format: long | short | data
Numbers such that ten 'Reverse and Add' steps are needed to reach a palindrome.
+10
3
829, 928, 9059, 9149, 9239, 9329, 9419, 9509, 9599, 9689, 9869, 9959, 10634, 10637, 10687, 10716, 10808, 10834, 10838, 10867, 10873, 10898, 10927, 10979, 11398, 11624, 11627, 11677, 11706, 11824, 11828, 11857, 11863, 11888, 11917, 11969
OFFSET
1,1
COMMENTS
The number of steps starts at 0, so palindromes (cf. A002113) are excluded.
MATHEMATICA
lenQ[n_]:= Length[NestWhileList[# + FromDigits[Reverse[IntegerDigits[#]]]&, n, #!= FromDigits[Reverse[IntegerDigits[#]]]&, 1, 11]] == 11; Select[Range[1000], lenQ] (* Vincenzo Librandi, Sep 24 2013 *)
CROSSREFS
Cf. A002113, A015991 (a different version), A065206.
KEYWORD
nonn,base
AUTHOR
Klaus Brockhaus, Oct 21 2001
STATUS
approved

Search completed in 0.005 seconds