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!)
A325342 Number of partitions p of n such that min(p) < (number of parts of p) <= max(p). 3
0, 0, 1, 1, 2, 3, 6, 8, 12, 17, 24, 33, 46, 61, 82, 108, 142, 184, 239, 305, 391, 495, 626, 786, 985, 1226, 1524, 1884, 2323, 2853, 3497, 4268, 5200, 6314, 7650, 9243, 11146, 13403, 16090, 19268, 23032, 27473, 32716, 38878, 46130, 54633, 64603, 76264, 89899 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
EXAMPLE
a(7) counts these 6 partitions: {6,1}, {5,1,1}, {4,2,1}, {4,1,1,1}, {3,3,1}, {3,2,2}.
MATHEMATICA
Table[Count[IntegerPartitions[n], q_ /; Min[q] < Length[q] <= Max[q]], {n, 60}]
CROSSREFS
Sequence in context: A111242 A343820 A133582 * A085642 A270738 A049194
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 19 09:23 EDT 2024. Contains 371782 sequences. (Running on oeis4.)