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 #9 May 15 2020 04:40:38
%S 0,0,0,0,1,1,2,2,5,7,11,14,21,28,40,52,73,94,127,162,216,274,357,449,
%T 579,724,920,1142,1439,1777,2216,2720,3368,4114,5056,6144,7506,9081,
%U 11028,13284,16052,19259,23157,27677,33139,39467,47060,55854,66355,78506
%N Number of partitions of n containing m(3) as a part, where m denotes multiplicity.
%e a(8) counts these 5 partitions: 431, 332, 3221, 32111, 311111.
%t z = 60; f[n_] := f[n] = IntegerPartitions[n];
%t Table[Count[f[n], p_ /; MemberQ[p, Count[p, 1]]], {n, 0, z}] (* A240486 *)
%t Table[Count[f[n], p_ /; MemberQ[p, Count[p, 2]]], {n, 0, z}] (* A240487 *)
%t Table[Count[f[n], p_ /; MemberQ[p, Count[p, 3]]], {n, 0, z}] (* A240488 *)
%t Table[Count[f[n], p_ /; MemberQ[p, Count[p, 4]]], {n, 0, z}] (* A240489 *)
%t Table[Count[f[n], p_ /; MemberQ[p, Count[p, 5]]], {n, 0, z}] (* A240490 *)
%Y Cf. A240486, A240487, A240489, A240490.
%K nonn,easy
%O 0,7
%A _Clark Kimberling_, Apr 06 2014