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 #6 Apr 23 2019 23:58:28
%S 0,0,1,1,3,3,7,7,13,15,25,28,44,52,76,91,128,155,211,255,340,415,540,
%T 656,842,1025,1297,1573,1970,2386,2959,3570,4394,5290,6460,7751,9411,
%U 11259,13592,16206,19468,23149,27678,32808,39070,46186,54783,64577,76332
%N Number of partitions of n with even minimal part and odd maximal part.
%C The four sequences A325338, A325344, A325345, A325346 partition the partition numbers, A000041.
%e a(5) counts these 3 partitions: [4,1], [2,2,1], [2,1,1,1].
%t Table[Count[IntegerPartitions[n], q_ /; EvenQ[Min[q]] && OddQ[Max[q]]], {n, 30}]
%Y Cf. A000041, A325338, A325345, A325346.
%K nonn,easy
%O 1,5
%A _Clark Kimberling_, Apr 23 2019