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!)
A325341 Number of partitions p of n such that min(p) <= (number of parts of p) < max(p). 3
0, 0, 0, 1, 2, 3, 4, 7, 10, 15, 21, 29, 39, 54, 71, 95, 124, 163, 209, 271, 344, 440, 554, 700, 874, 1095, 1357, 1685, 2076, 2559, 3132, 3837, 4671, 5687, 6889, 8343, 10058, 12123, 14552, 17459, 20875, 24941, 29706, 35358, 41966, 49768, 58875, 69587, 82061 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
EXAMPLE
a(7) counts these 4 partitions: {6,1}, {5,2}, {5,1,1}, {4,2,1}.
MATHEMATICA
Table[Count[IntegerPartitions[n], q_ /; Min[q] <= Length[q] < Max[q]], {n, 60}]
CROSSREFS
Sequence in context: A267459 A330357 A145467 * A039841 A078159 A129490
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 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)