|
%I #8 Mar 15 2024 21:31:27
%S 0,0,0,0,0,0,1,0,1,1,4,2,5,6,10,16,17,23,32,42,53,79,88,117,146,189,
%T 230,298,374,452,562,688,842,1036,1256,1520,1876,2225,2688,3226,3875,
%U 4608,5528,6553,7799,9272,10936,12903,15239,17919,21038,24714,28922,33819
%N Number of partitions p of n such that (maximal multiplicity over the parts of p) = (number of numbers in p having multiplicity > 1).
%H Alois P. Heinz, <a href="/A241132/b241132.txt">Table of n, a(n) for n = 0..1000</a>
%e a(10) counts these 4 partitions: 4411, 42211, 3322, 33211.
%t z = 30; e[p_] := Length[DeleteDuplicates[Select[p, Count[p, #] > 1 &]]];
%t m[p_] := Max[Map[Length, Split[p]]]; Table[Count[IntegerPartitions[n], p_ /; m[p] == e[p]], {n, 0, z}]
%Y Cf. A241090, A241131.
%K nonn,easy
%O 0,11
%A _Clark Kimberling_, Apr 24 2014
|
