OFFSET
0,3
COMMENTS
Every sequence can be uniquely split into a sequence of non-overlapping runs. For example, the runs of (2,2,1,1,1,3,2,2) are ((2,2),(1,1,1),(3),(2,2)), with sums (4,3,3,4).
LINKS
Joseph Likar, Table of n, a(n) for n = 0..120
EXAMPLE
The a(0) = 1 through a(5) = 12 compositions:
() (1) (2) (3) (4) (5)
(11) (12) (13) (14)
(21) (22) (23)
(111) (31) (32)
(1111) (41)
(113)
(122)
(221)
(311)
(1112)
(2111)
(11111)
For n=4, (211) is invalid because the two runs (2) and (11) have the same sum. - Joseph Likar, Aug 04 2023
MATHEMATICA
Table[Length[Select[Join@@Permutations/@IntegerPartitions[n], UnsameQ@@Total/@Split[#]&]], {n, 0, 15}]
CROSSREFS
For distinct parts instead of run-sums we have A032020.
For distinct multiplicities instead of run-sums we have A242882.
For runs instead of run-sums we have A351013.
These compositions are ranked by A353852.
A005811 counts runs in binary expansion.
A011782 counts compositions.
A175413 lists numbers whose binary expansion has all distinct runs.
A353847 gives composition run-sum transformation.
KEYWORD
nonn
AUTHOR
Gus Wiseman, May 31 2022
EXTENSIONS
Terms a(21) and onwards from Joseph Likar, Aug 04 2023
STATUS
approved