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 #4 Mar 31 2012 12:35:29
%S 0,0,0,1,1,1,1,1,1,1,1,2,1,1,2,2,2,3,3,3,4,4,4,5,5,5,6,7,6,7,7,8,9,9,
%T 10,10,10,10,12,13,12,14,14,14,15,17,18,18,20,20,21,22,24,26,26,28,29,
%U 30,31,35,36,36,39,41,42,44,47,49,50,53,54,57,58,61,66,66,69,72,75,77,82,85,86,91
%N Number of partitions of n into powers of two minus one where every part appears at least 4 times
%H R. H. Hardin, <a href="/A161066/b161066.txt">Table of n, a(n) for n=1..1000</a>
%K nonn
%O 1,12
%A _R. H. Hardin_ Jun 02 2009