login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A241131 Number of partitions p of n such that (maximal multiplicity over the parts of p) = number of 1s in p. 3
0, 1, 1, 2, 3, 4, 7, 9, 13, 18, 26, 32, 47, 60, 79, 104, 137, 173, 227, 285, 365, 461, 583, 724, 912, 1129, 1403, 1729, 2137, 2611, 3211, 3906, 4765, 5777, 7010, 8450, 10213, 12263, 14738, 17637, 21113, 25158, 30008, 35638, 42333, 50130, 59346, 70035, 82663 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

Table of n, a(n) for n=0..48.

FORMULA

a(6) counts these 7 partitions:  51, 411, 321, 3111, 2211, 21111, 111111.

MATHEMATICA

z = 30; m[p_] := Max[Map[Length, Split[p]]]; Table[Count[IntegerPartitions[n], p_ /; m[p] == Count[p, 1]], {n, 0, z}]

CROSSREFS

Cf. A241090, A241132.

Sequence in context: A188381 A005576 A339592 * A339397 A129373 A139078

Adjacent sequences:  A241128 A241129 A241130 * A241132 A241133 A241134

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Apr 24 2014

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 05:34 EDT 2021. Contains 343199 sequences. (Running on oeis4.)