A357691 Number of ways to write n as an ordered sum of six positive Fibonacci numbers (with a single type of 1).

1, 6, 21, 50, 96, 156, 231, 312, 405, 506, 621, 726, 828, 930, 1041, 1160, 1290, 1422, 1520, 1590, 1677, 1766, 1887, 1980, 2106, 2196, 2310, 2426, 2550, 2670, 2706, 2700, 2736, 2756, 2850, 2916, 3071, 3156, 3186, 3296, 3396, 3510, 3621, 3636, 3765, 3720, 3840, 3966, 4010

Offset

6,2

Links

Alois P. Heinz, Table of n, a(n) for n = 6..17711

Formula

G.f.: ( Sum_{k>=2} x^Fibonacci(k) )^6.

a(n) = A121548(n,6).

Mathematica

nmax = 54; CoefficientList[Series[Sum[x^Fibonacci[k], {k, 2, 21}]^6, {x, 0, nmax}], x] // Drop[#, 6] &

Crossrefs

Cf. A000045, A076739, A121548, A121549, A121550, A319399, A357688, A357690.

Sequence in context: A372226 A163715 A028345 * A341985 A341066 A263418

Adjacent sequences: A357688 A357689 A357690 * A357692 A357693 A357694

Keyword

nonn

Author

Ilya Gutkovskiy, Oct 10 2022

Status

approved