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 #8 Jun 13 2012 17:44:44
%S 1,0,1,0,1,1,1,1,2,1,3,2,3,3,5,4,6,6,8,8,12,10,15,15,19,21,26,26,34,
%T 36,45,47,59,61,76,83,97,107,128,137,165,179,210,231,271,296,345,380,
%U 438,485,561,614,708,783,893,991,1129,1246,1420,1572,1781
%N Number of partitions of n in which all parts are >= 2 and the largest part occurs at least five times.
%F a(n) = A186445(n) - 2*A186445(n-1) + A186445(n-2).
%F G.f.: (1-x)*Product_{k>4} 1/(1-x^k)
%e For n = 20 we have three partitions: {[4+4+4+4+4], [3+3+3+3+3+3+2], [2+2+2+2+2+2+2+2+2+2]}, so a(20) = 3.
%Y Cf. A000041, A186445, A213423.
%K nonn
%O 10,9
%A _Mircea Merca_, Jun 11 2012