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”).
%I #11 Feb 16 2014 15:35:21
%S 1,0,1,1,3,3,4,4,10,12,14,16,19,21,24,27,64,72,84,94,108,120,136,150,
%T 169,185,206,225,249,270,297,321,831,918,1014,1115,1226,1342,1469,
%U 1602,1747,1898,2062,2233,2418,2611,2818,3034,3266,3507,3765,4033,4319,4616,4932
%N Number of partitions of n into parts not greater than floor(log_2(n)).
%H Alois P. Heinz, <a href="/A097355/b097355.txt">Table of n, a(n) for n = 0..1000</a>
%t a[n_] := Length[ IntegerPartitions[n, Floor[Log[2, n]]]]; Table[a[n], {n, 1, 54}] (* _Jean-François Alcover_, May 24 2012 *)
%Y Cf. A000523, A000041, A097356.
%K nonn
%O 0,5
%A _Reinhard Zumkeller_, Aug 08 2004