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 #4 Apr 28 2014 18:42:07
%S 0,0,1,1,2,3,3,5,6,9,12,16,23,26,39,45,67,78,106,130,171,207,270,329,
%T 419,516,637,787,978,1190,1451,1775,2166,2613,3173,3827,4613,5537,
%U 6659,7948,9523,11316,13505,16014,19059,22455,26667,31376,37079,43501,51282
%N Number of partitions of n such that the number of parts having multiplicity >1 is a part and the number of distinct parts is a part.
%C As used here, the term "distinct parts" includes each number, once, that occurs more than once; e.g., the distinct parts of the partition {4,3,3,1,1,1} are 4, 3, 1.
%e a(6) counts these 3 partitions: 411, 3111, 21111.
%t z = 30; f[n_] := f[n] = IntegerPartitions[n]; e[p_] := Length[DeleteDuplicates[Select[p, Count[p, #] > 1 &]]]; d[p_] := Length[DeleteDuplicates[p]];
%t Table[Count[f[n], p_ /; MemberQ[p, e[p]]], {n, 0, z}] (* A241408 *)
%t Table[Count[f[n], p_ /; MemberQ[p, e[p]] && MemberQ[p, d[p]]], {n, 0, z}] (* A241409 *)
%t Table[Count[f[n], p_ /; ! MemberQ[p, e[p]] && MemberQ[p, d[p]] ], {n, 0, z}] (* A241410 *)
%t Table[Count[f[n], p_ /; MemberQ[p, e[p]] && ! MemberQ[p, d[p]] ], {n, 0, z}] (* A241411 *)
%t Table[Count[f[n], p_ /; ! MemberQ[p, e[p]] && ! MemberQ[p, d[p]] ], {n, 0, z}] (* A241412 *)
%Y Cf. A241408, A241410, A241411, A241412.
%K nonn,easy
%O 0,5
%A _Clark Kimberling_, Apr 22 2014