login
A384887
Number of integer partitions of n with all equal lengths of maximal gapless runs (decreasing by 0 or 1).
12
1, 1, 2, 3, 5, 6, 9, 10, 14, 18, 21, 26, 35, 39, 46, 58, 68, 79, 97, 111, 131, 155, 177, 206, 246, 278, 318, 373, 423, 483, 563, 632, 722, 827, 931, 1058, 1209, 1354, 1528, 1736, 1951, 2188, 2475, 2762, 3097, 3488, 3886, 4342, 4876, 5414, 6038, 6741, 7482
OFFSET
0,3
EXAMPLE
The partition y = (6,5,5,5,3,3,2,1) has maximal gapless runs ((6,5,5,5),(3,3,2,1)), with lengths (4,4), so y is counted under a(30).
The a(1) = 1 through a(8) = 14 partitions:
(1) (2) (3) (4) (5) (6) (7) (8)
(11) (21) (22) (32) (33) (43) (44)
(111) (31) (41) (42) (52) (53)
(211) (221) (51) (61) (62)
(1111) (2111) (222) (322) (71)
(11111) (321) (2221) (332)
(2211) (3211) (2222)
(21111) (22111) (3221)
(111111) (211111) (3311)
(1111111) (22211)
(32111)
(221111)
(2111111)
(11111111)
MATHEMATICA
Table[Length[Select[IntegerPartitions[n], SameQ@@Length/@Split[#, #2>=#1-1&]&]], {n, 0, 15}]
CROSSREFS
The strict case is A384886, distinct A384178.
For distinct instead of equal lengths we have A384884.
For anti-runs instead of runs we have A384888, distinct A384885.
For subsets instead of strict partitions we have A243815.
Without counting decreases by 0 we get A384904.
A000041 counts integer partitions, strict A000009.
A007690 counts partitions with no singletons, complement A183558.
A034296 counts flat or gapless partitions, ranks A066311 or A073491.
A098859 counts Wilf partitions (distinct multiplicities), complement A336866.
A355394 counts partitions without a neighborless part, singleton case A355393.
A356236 counts partitions with a neighborless part, singleton case A356235.
A356606 counts strict partitions without a neighborless part, complement A356607.
Sequence in context: A076061 A025523 A173382 * A128689 A116137 A178611
KEYWORD
nonn
AUTHOR
Gus Wiseman, Jun 15 2025
STATUS
approved