A357730 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A357730

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

1, 10, 55, 210, 625, 1542, 3300, 6310, 11040, 17980, 27673, 40660, 57475, 78520, 104175, 134742, 170620, 212220, 260035, 314290, 374933, 441790, 514855, 594210, 680070, 772582, 871920, 977790, 1090680, 1210960, 1339417, 1475340, 1618020, 1766080, 1918785, 2076012

(list; graph; refs; listen; history; text; internal format)

OFFSET

10,2

LINKS

Table of n, a(n) for n=10..45.

FORMULA

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

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

MATHEMATICA

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

CROSSREFS