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

A161036
Number of partitions of n into Fibonacci numbers where every part appears at least 12 times
1
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 4, 2, 4, 4, 5, 4, 7, 5, 7, 7, 8, 7, 11, 9, 11, 12, 13, 12, 16, 14, 16, 17, 18, 17, 23, 19, 22, 23, 24, 24, 28, 25, 28, 29, 31, 29, 36, 33, 37, 40, 41, 42, 49, 47, 53, 55, 59, 60, 69, 68, 74, 78, 83, 85, 95, 94, 102, 107
OFFSET
1,24
LINKS
CROSSREFS
Sequence in context: A363827 A161317 A161251 * A161087 A161303 A161278
KEYWORD
nonn
AUTHOR
R. H. Hardin Jun 02 2009
STATUS
approved