|
Search: id:A034306
|
|
|
| A034306 |
|
Fibonacci iteration F(1,palindrome a(n)) leads to a 'nine digits' anagram. |
|
+0
4
|
|
| 4004, 630036, 1559551, 4187814, 4870784, 6097906, 6834386, 9530359, 50755705, 51733715, 54988945, 62399326, 62488426, 63299236, 63477436, 64288246, 64377346, 71399317, 71488417, 73199137, 73466437, 74188147, 74366347
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
In total there are exactly 68 such palindromes (437606734 is the largest).
|
|
LINKS
|
P. De Geest, Nine Digits Digressions
|
|
EXAMPLE
|
E.g. F(1,9530359) -> + 9530360 -> + 19060719 -> + 28591079 -> + 47651798 -> + 76242877 and finally we have -> '123894675' which is our 'nine digits' anagram.
|
|
CROSSREFS
|
Sequence in context: A045262 A061700 A092722 this_sequence A107285 A099229 A124728
Adjacent sequences: A034303 A034304 A034305 this_sequence A034307 A034308 A034309
|
|
KEYWORD
|
nonn,base,fini
|
|
AUTHOR
|
Patrick De Geest (pdg(AT)worldofnumbers.com), Oct 15 1998.
|
|
|
Search completed in 0.002 seconds
|
