OFFSET
0,6
COMMENTS
EXAMPLE
The partition (3,2,1,1,1) has runs ((3),(2),(1,1,1)) with sums (3,2,3) so is counted under a(8).
The a(3) = 1 through a(8) = 15 partitions:
(21) (31) (32) (42) (43) (53)
(41) (51) (52) (62)
(221) (321) (61) (71)
(311) (411) (322) (332)
(2111) (2211) (331) (431)
(21111) (421) (521)
(511) (611)
(2221) (3221)
(3211) (3311)
(4111) (4211)
(22111) (5111)
(31111) (22211)
(211111) (32111)
(311111)
(2111111)
MATHEMATICA
Table[Length[Select[IntegerPartitions[n], !SameQ@@Total/@Split[#]&]], {n, 0, 15}]
CROSSREFS
For distinct instead of equal block-sums we have A381717.
A326534 ranks multiset partitions with a common sum.
A353837 counts partitions with distinct run-sums.
A354584 lists run-sums of weakly increasing prime indices.
A355743 ranks multiset partitions into constant blocks.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Apr 02 2025
EXTENSIONS
More terms from Bert Dobbelaere, Apr 26 2025
STATUS
approved
