A358005 Number of partitions of n into 5 distinct positive Fibonacci numbers (with a single type of 1).
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
Keywords
Links
- Robert Israel, Table of n, a(n) for n = 19..10000
Crossrefs
Programs
-
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