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 #5 Mar 02 2014 16:05:49
%S 1,2,3,5,6,11,14,20,28,40,50,72,93,124,161,213,270,355,447,573,723,
%T 919,1142,1441,1786,2225,2745,3398,4160,5121,6240,7623,9255,11246,
%U 13577,16423,19753,23767,28478,34125,40723,48614,57815,68740,81496,96568,114103
%N Number of partitions p of n such that 2*min(p) + (number of parts of p) is not a part of p.
%F a(n) + A097091(n) = A000041(n).
%e a(8) counts all the 22 partitions of 8 except 62 and 521.
%t Table[Count[IntegerPartitions[n], p_ /; ! MemberQ[p, Length[p] + 2*Min[p]]], {n, 50}]
%Y Cf. A097091.
%K nonn,easy
%O 1,2
%A _Clark Kimberling_, Feb 28 2014