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 #7 Jun 18 2015 03:59:28
%S 0,1,1,2,2,3,3,6,6,10,13,18,22,33,38,52,65,85,102,135,161,208,252,316,
%T 381,481,574,711,855,1049,1252,1532,1820,2207,2624,3156,3740,4486,
%U 5291,6308,7436,8824,10363,12258,14356,16912,19774,23202,27056,31671,36833
%N Number of partitions p of n such that (number of parts of p) - min(p) is a part of p.
%F a(n) + A238548(n) = A000041(n).
%e a(6) counts these partitions: 71, 521, 41111.
%t Table[Count[IntegerPartitions[n], p_ /; MemberQ[p, Length[p]-Min[p]]], {n, 50}]
%o (PARI) a(n) = {my(nb = 0); forpart(p=n, if (vecsearch(Vec(p), #p-vecmin(p)), nb++);); nb;} \\ _Michel Marcus_, Jun 18 2015
%Y Cf. A238548.
%K nonn,easy
%O 1,4
%A _Clark Kimberling_, Feb 28 2014