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

A161035
Number of partitions of n into Fibonacci numbers where every part appears at least 11 times.
1
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 3, 3, 3, 5, 4, 5, 6, 6, 6, 8, 7, 9, 10, 10, 11, 13, 12, 14, 15, 15, 16, 18, 19, 19, 21, 21, 22, 25, 24, 25, 27, 27, 29, 32, 32, 34, 37, 39, 41, 45, 46, 49, 54, 56, 60, 64, 67, 71, 77, 80, 84, 90, 94, 99, 106, 112, 116, 124
OFFSET
1,22
LINKS
CROSSREFS
Sequence in context: A175830 A161316 A161250 * A161086 A161302 A161277
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jun 02 2009
STATUS
approved