|
%I #7 Apr 23 2019 23:58:20
%S 1,0,1,2,3,4,7,9,14,19,27,36,50,65,87,114,149,192,249,316,404,510,643,
%T 805,1008,1251,1553,1917,2361,2895,3546,4322,5262,6383,7728,9330,
%U 11245,13512,16213,19405,23186,27643,32907,39089,46366,54894,64893,76584,90256
%N Number of partitions p of n such that min(p) <= (number of parts of p) <= max(p).
%e a(7) counts these 7 partitions: {6,1}, {5,2}, {5,1,1, {4,2,1}, {4,1,1,1}, {3,3,1}, {3,2,2}.
%t Table[Count[IntegerPartitions[n], q_ /; Min[q] <= Length[q] <= Max[q]], {n, 60}]
%Y Cf. A000041, A325340, A325341, A325342.
%K nonn,easy
%O 1,4
%A _Clark Kimberling_, Apr 21 2019
|
