|
|
A036110
|
|
A summarize Fibonacci sequence: summarize the previous two terms!.
|
|
0
|
|
|
2, 2, 22, 32, 1332, 332211, 433231, 14533231, 1524632231, 162524534241, 263544336241, 363564435231, 463554733221, 17364544733221, 37263554634231, 37363554734231, 37364544933221, 1937263554933221, 3927263544835231, 391827264534836231, 293827363544836231
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
From the 26th term the sequence gets into a cycle of 46.
|
|
LINKS
|
|
|
PROG
|
(Python)
def aupton(nn):
alst = [2, 2]
for n in range(2, nn+1):
prev2, anstr = sorted(str(alst[-2]) + str(alst[-1])), ""
for d in sorted(set(prev2), reverse=True):
anstr += str(prev2.count(d)) + d
alst.append(int(anstr))
return alst
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|