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”).

A358005
Number of partitions of n into 5 distinct positive Fibonacci numbers (with a single type of 1).
5
1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 2, 1, 3, 2, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 2, 2, 2, 3, 1, 2, 2, 1, 3, 2, 2, 2, 1, 2
OFFSET
19,27
LINKS
MAPLE
G:= mul(1+t*x^combinat:-fibonacci(k), k=2..21):
S:= coeff(expand(G), t, 5):
seq(coeff(S, x, i), i=19..110); # Robert Israel, Jan 06 2023
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Oct 24 2022
STATUS
approved