A357716 - OEIS

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

A357716

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

1, 8, 36, 112, 274, 560, 1008, 1640, 2479, 3536, 4844, 6392, 8170, 10136, 12308, 14680, 17291, 20160, 23248, 26440, 29674, 32992, 36456, 40040, 43834, 47712, 51752, 55840, 60250, 64856, 69560, 74088, 78331, 82440, 86500, 90616, 95074, 99568, 104188, 108528, 113304

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

OFFSET

8,2

LINKS

Table of n, a(n) for n=8..48.

FORMULA

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

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

MATHEMATICA

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

CROSSREFS