|
|
A325228
|
|
Number of integer partitions of n such that the lesser of the maximum part and the number of parts is 3.
|
|
2
|
|
|
0, 0, 0, 0, 1, 3, 6, 9, 13, 16, 20, 24, 28, 32, 38, 42, 48, 54, 60, 66, 74, 80, 88, 96, 104, 112, 122, 130, 140, 150, 160, 170, 182, 192, 204, 216, 228, 240, 254, 266, 280, 294, 308, 322, 338, 352, 368, 384, 400, 416, 434, 450, 468, 486, 504, 522, 542, 560
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,6
|
|
LINKS
|
|
|
EXAMPLE
|
The a(5) = 1 through a(10) = 16 partitions:
(311) (321) (322) (332) (333) (433)
(411) (331) (422) (432) (442)
(3111) (421) (431) (441) (532)
(511) (521) (522) (541)
(3211) (611) (531) (622)
(31111) (3221) (621) (631)
(3311) (711) (721)
(32111) (3222) (811)
(311111) (3321) (3322)
(32211) (3331)
(33111) (32221)
(321111) (33211)
(3111111) (322111)
(331111)
(3211111)
(31111111)
|
|
MATHEMATICA
|
Table[Length[Select[IntegerPartitions[n], Min[Length[#], Max[#]]==3&]], {n, 30}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|