|
Search: id:A069638
|
|
|
| A069638 |
|
"Sorted" sum of two previous terms, beginning with 1,1. "Sorted" means to sort the digits of the sum in ascending order. |
|
+0
6
|
|
| 1, 1, 2, 3, 5, 8, 13, 12, 25, 37, 26, 36, 26, 26, 25, 15, 4, 19, 23, 24, 47, 17, 46, 36, 28, 46, 47, 39, 68, 17, 58, 57, 115, 127, 224, 135, 359, 449, 88, 357, 445, 28, 347, 357, 47, 44, 19, 36, 55, 19, 47, 66, 113, 179, 229, 48, 277, 235, 125, 36, 116, 125, 124, 249, 337
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
The maximum value in this sequence is 667. After the 75th term, the next 120 terms (a(76) - a(195)) repeat as a group infinitely.
|
|
LINKS
|
Gil Broussard, Term Sorted Fibonacci Sequence. [Broken link?]
|
|
FORMULA
|
a(n) = SORT[a(n-1) + a(n-2)].
|
|
EXAMPLE
|
a(8)=12 because a(7)+a(6)=13+8=21, and the digits of 21 sorted in ascending order = 12.
Also a(17)=4 because a(16)+a(15)=15+25=40, and the digits of 40 sorted in ascending order = 04, or just 4;
|
|
CROSSREFS
|
Cf. A000045.
Adjacent sequences: A069635 A069636 A069637 this_sequence A069639 A069640 A069641
Sequence in context: A131297 A010077 A065076 this_sequence A010076 A138183 A076591
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Gil Broussard (kikiriki(AT)mindspring.com), Jan 16 2004
|
|
|
Search completed in 0.002 seconds
|
