login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
LINKS
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
Sequence in context: A306777 A062891 A018599 * A018347 A308824 A039903
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Apr 21 2019
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 08:27 EDT 2024. Contains 371964 sequences. (Running on oeis4.)