login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A103197
Number of compositions of n into Fibonacci number of parts.
0
1, 2, 4, 7, 12, 21, 37, 65, 115, 208, 386, 727, 1367, 2536, 4630, 8376, 15217, 28170, 53620, 104843, 208547, 416448, 824990, 1608138, 3071813, 5747106, 10561032, 19177849, 34734782, 63495907, 118601911, 228454377, 454988025, 932297291
OFFSET
1,2
FORMULA
a(n) = Sum_{k=0..n} binomial(n-1, k-1)*A010056(k).
a(n) = Sum_{k>1} (x/(1-x))^Fibonacci(k).
MATHEMATICA
Flatten[{1, 2, 4, Table[SeriesCoefficient[Sum[(x/(1-x))^Fibonacci[k], {k, 2, n}], {x, 0, n}], {n, 4, 35}]}] (* Vaclav Kotesovec, May 01 2014 *)
CROSSREFS
Sequence in context: A189600 A005251 A014167 * A307543 A255062 A307058
KEYWORD
easy,nonn
AUTHOR
Vladeta Jovovic, Mar 18 2005
STATUS
approved