|
|
A090070
|
|
Numbers n such that there are (presumably) nine palindromes in the Reverse and Add! trajectory of n.
|
|
2
|
|
|
4, 10, 11, 535, 1000, 1001, 10007, 10101, 20006, 30005, 50003, 60002, 70001, 80000, 80008, 100070, 110060, 120050, 130040, 140030, 150020, 160010, 170000, 170071, 200000, 200002, 1000003, 1000150, 1001001, 1010050, 1100140, 1110040, 1200130
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
For terms < 5000000 each palindrome is reached from the preceding one or from the start in at most 35 steps; after the presumably last one no further palindrome is reached in 2000 steps.
|
|
LINKS
|
|
|
EXAMPLE
|
The trajectory of 4 begins 4, 8, 16, 77, 154, 605, 1111, 2222, 4444, 8888, 17776, 85547, 160105, 661166, 1322332, 3654563, 7309126, ...; at 7309126 it joins the (presumably) palindrome-free trajectory of A063048(7) = 10577, hence 4, 8, 77, 1111, 2222, 4444, 8888, 661166 and 3654563 are the nine palindromes in the trajectory of 4 and 4 is a term.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|