A357688 - OEIS

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

A357688

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

1, 4, 10, 16, 23, 28, 34, 36, 43, 48, 50, 48, 50, 56, 58, 64, 67, 60, 58, 52, 64, 64, 70, 68, 70, 76, 70, 72, 79, 60, 60, 48, 58, 68, 60, 84, 80, 64, 82, 64, 82, 88, 66, 76, 66, 64, 84, 60, 79, 60, 24, 60, 36, 60, 74, 48, 88, 76, 72, 96, 68, 88, 76, 48, 82, 60, 70

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

OFFSET

4,2

LINKS

Alois P. Heinz, Table of n, a(n) for n = 4..10000

FORMULA

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

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

MATHEMATICA

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

CROSSREFS

Cf. A000045, A076739, A121548, A121549, A121550, A319397, A357690, A357691.