login

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”).

A325340
Number of partitions p of n such that min(p) < (number of parts of p) < max(p).
3
0, 0, 0, 1, 1, 2, 3, 6, 9, 13, 18, 26, 35, 50, 66, 90, 117, 155, 199, 260, 331, 425, 537, 681, 852, 1070, 1328, 1652, 2038, 2517, 3083, 3783, 4609, 5618, 6811, 8257, 9959, 12014, 14429, 17322, 20721, 24771, 29515, 35147, 41730, 49507, 58585, 69267, 81705
OFFSET
1,6
EXAMPLE
a(7) counts these 3 partitions: {6,1}, {5,1,1}, {4,2,1}.
MATHEMATICA
Table[Count[IntegerPartitions[n], q_ /; Min[q] < Length[q] < Max[q]], {n, 60}]
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Apr 21 2019
STATUS
approved