A036109 A summarize Fibonacci sequence: summarize the previous two terms!.

2, 1, 1211, 1241, 142251, 15243241, 2534134241, 2554334241, 3564434231, 163564533221, 363544633231, 463534833231, 183625441032221, 2826254473524110, 281726355433825120, 382726554443824120, 482726555453823120, 482726656443822120, 482746555433922120

Offset: 0

Author

Floor van Lamoen

Keywords

• base
• easy
• nonn

Comments

From the 25th term the sequence gets into a cycle of 117.

Links

• Alois P. Heinz, Table of n, a(n) for n = 0..1000
• Index to sequences related to say what you see

Crossrefs

Cf. A036059.

Programs

Maple

a:= proc(n) option remember; `if`(n<2, 2-n, (p-> parse(cat(seq((c->
     `if`(c=0, [][], [c, 9-i][]))(coeff(p, x, 9-i)), i=0..9))))(
      add(x^i, i=map(x-> convert(x, base, 10)[], [a(n-1),a(n-2)]))))
    end:
seq(a(n), n=0..20);  # Alois P. Heinz, Jun 18 2022