OFFSET
0,3
FORMULA
EXAMPLE
The partition (4,4,2,2,2,2,1,1,1,1,1,1,1,1) has two partitions into constant blocks with a common sum: {{4,4},{2,2,2,2},{1,1,1,1,1,1,1,1}} and {{4},{4},{2,2},{2,2},{1,1,1,1},{1,1,1,1}}, so is counted under a(24).
The a(1) = 1 through a(8) = 9 partitions:
(1) (2) (3) (4) (5) (6) (7) (8)
(11) (111) (22) (11111) (33) (1111111) (44)
(211) (222) (422)
(1111) (2211) (2222)
(3111) (22211)
(21111) (41111)
(111111) (221111)
(2111111)
(11111111)
MATHEMATICA
mce[y_]:=Table[ConstantArray[y[[1]], #]&/@ptn, {ptn, IntegerPartitions[Length[y]]}];
Table[Length[Select[IntegerPartitions[n], Length[Select[Join@@@Tuples[mce/@Split[#]], SameQ@@Total/@#&]]>0&]], {n, 0, 30}]
CROSSREFS
Twice-partitions of this type (constant with common) are counted by A279789.
Multiset partitions of this type are ranked by A383309.
For distinct instead of equal block-sums we have A382427.
A323774 counts partitions into constant blocks with a common sum
KEYWORD
nonn
AUTHOR
Gus Wiseman, Apr 22 2025
EXTENSIONS
More terms from Jakub Buczak, May 03 2025
STATUS
approved
