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

A161072
Number of partitions of n into powers of two minus one where every part appears at least 10 times
1
0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 11, 11, 11, 12, 13, 12, 13, 13, 13, 14, 14, 15, 15, 15, 16, 17, 17, 17, 19, 18, 18, 20, 20, 20, 21, 22, 21, 22, 23, 23, 24, 24, 25
OFFSET
1,30
LINKS
CROSSREFS
Sequence in context: A161112 A161047 A331479 * A161111 A161046 A330556
KEYWORD
nonn
AUTHOR
R. H. Hardin Jun 02 2009
STATUS
approved