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 #10 Feb 23 2019 16:54:45
%S 0,1,1,2,1,4,2,5,5,7,6,12,9,14,15,19,18,28,24,34,35,43,42,59,53,70,72,
%T 86,86,112,105,132,136,158,160,198,191,231,238,273,277,332,326,384,
%U 394,447,455,532,529,610,626,703,717,821,824,934,959,1066,1089,1230,1240,1388
%N Number of partitions of n into central binomial coefficients A001405 where every part appears at least 2 times.
%H R. H. Hardin, <a href="/A161241/b161241.txt">Table of n, a(n) for n=1..1000</a>
%Y Cf. A001405.
%K nonn
%O 1,4
%A _R. H. Hardin_, Jun 06 2009