OFFSET
0,4
COMMENTS
T. D. Noe found that the maximum is attained at a(4992871827) = 234444568999. The periodic part of this sequence begins at a(3544675600) and has length 5158842780.
LINKS
Harvey P. Dale, Table of n, a(n) for n = 0..1000
Richard I. Hess, Problem 920: sorted Fibonacci sequence, Pi Mu Epsilon Journal, Vol. 10 (Fall 1998) No. 9, pp. 754-755.
EXAMPLE
a(7) = SORT[a(0) + a(1) + a(2) + a(3) + a(4) + a(5) + a(6)] = SORT[0 + 1 + 1 + 2 + 4 + 8 + 16] = SORT[32] = 23.
a(8) = SORT[a(1) + a(2) + a(3) + a(4) + a(5) + a(6) + a(7)] = SORT[1 + 1 + 2 + 4 + 8 + 16 + 23] = SORT[55] = 55.
a(9) = SORT[a(2) + a(3) + a(4) + a(5) + a(6) + a(7) + a(8)] = SORT[1 + 2 + 4 + 8 + 16 + 23 + 55] = SORT[109] = 19.
MATHEMATICA
nxt[{a_, b_, c_, d_, e_, f_, g_}]:={b, c, d, e, f, g, FromDigits[Sort[ IntegerDigits[ a+b+c+d+e+f+g]/.(0->Nothing)]]}; NestList[nxt, {0, 1, 1, 2, 4, 8, 16}, 50][[All, 1]] (* Harvey P. Dale, May 09 2020 *)
CROSSREFS
KEYWORD
base,easy,nonn
AUTHOR
Jonathan Vos Post, Jun 11 2005
STATUS
approved