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

A097355
Number of partitions of n into parts not greater than floor(log_2(n)).
2
1, 0, 1, 1, 3, 3, 4, 4, 10, 12, 14, 16, 19, 21, 24, 27, 64, 72, 84, 94, 108, 120, 136, 150, 169, 185, 206, 225, 249, 270, 297, 321, 831, 918, 1014, 1115, 1226, 1342, 1469, 1602, 1747, 1898, 2062, 2233, 2418, 2611, 2818, 3034, 3266, 3507, 3765, 4033, 4319, 4616, 4932
OFFSET
0,5
LINKS
MATHEMATICA
a[n_] := Length[ IntegerPartitions[n, Floor[Log[2, n]]]]; Table[a[n], {n, 1, 54}] (* Jean-François Alcover, May 24 2012 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Aug 08 2004
STATUS
approved