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!)
A325343 Number of partitions p of n such that min(p) <= (number of parts of p) <= max(p). 3
1, 0, 1, 2, 3, 4, 7, 9, 14, 19, 27, 36, 50, 65, 87, 114, 149, 192, 249, 316, 404, 510, 643, 805, 1008, 1251, 1553, 1917, 2361, 2895, 3546, 4322, 5262, 6383, 7728, 9330, 11245, 13512, 16213, 19405, 23186, 27643, 32907, 39089, 46366, 54894, 64893, 76584, 90256 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Table of n, a(n) for n=1..49.

EXAMPLE

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}.

MATHEMATICA

Table[Count[IntegerPartitions[n], q_ /; Min[q] <= Length[q] <= Max[q]], {n, 60}]

CROSSREFS

Cf. A000041, A325340, A325341, A325342.

Sequence in context: A049709 A108950 A238545 * A238495 A239329 A094093

Adjacent sequences:  A325340 A325341 A325342 * A325344 A325345 A325346

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 May 23 10:51 EDT 2022. Contains 353975 sequences. (Running on oeis4.)