A093088 "Fibonacci-like in digits": start with a(1)=1, a(2)=4; repeatedly adjoin digits of sum of previous two terms.

1, 4, 5, 9, 1, 4, 1, 0, 5, 5, 1, 5, 1, 0, 6, 6, 6, 1, 6, 1, 2, 1, 2, 7, 7, 7, 3, 3, 3, 9, 1, 4, 1, 4, 1, 0, 6, 6, 1, 2, 1, 0, 5, 5, 5, 5, 1, 6, 1, 2, 7, 3, 3, 1, 5, 1, 0, 1, 0, 1, 0, 6, 7, 7, 3, 9, 1, 0, 6, 4, 6, 6, 1, 1, 1, 1, 1, 6, 1, 3, 1, 4, 1, 0, 1, 2, 1, 0, 1, 6, 1, 0, 1, 0, 1, 2, 7, 2, 2, 2, 2, 7, 7, 4, 4

Offset: 1

Author

Bodo Zinser, Mar 20 2004

Keywords

• nonn
• base

Links

• Paolo Xausa, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A093086, A093087.

Programs

Mathematica

Fold[Join[#, IntegerDigits[Total[#[[#2;; #2+1]]]]] &, {1, 4}, Range[100]] (* Paolo Xausa, Aug 18 2025 *)