|
|
A357716
|
|
Number of ways to write n as an ordered sum of eight positive Fibonacci numbers (with a single type of 1).
|
|
4
|
|
|
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
|
|
|
FORMULA
|
G.f.: ( Sum_{k>=2} x^Fibonacci(k) )^8.
|
|
MATHEMATICA
|
nmax = 48; CoefficientList[Series[Sum[x^Fibonacci[k], {k, 2, 21}]^8, {x, 0, nmax}], x] // Drop[#, 8] &
|
|
CROSSREFS
|
Cf. A000045, A076739, A121548, A121549, A121550, A319401, A357688, A357690, A357691, A357694, A357717.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|