OFFSET
0,3
COMMENTS
The leaders of weakly increasing runs in a sequence are obtained by splitting it into maximal weakly increasing subsequences and taking the first term of each.
LINKS
EXAMPLE
The composition (1,3,3,2,4,3) has weakly increasing runs ((1,3,3),(2,4),(3)), with leaders (1,2,3), so is counted under a(16).
The a(0) = 1 through a(7) = 17 compositions:
() (1) (2) (3) (4) (5) (6) (7)
(11) (12) (13) (14) (15) (16)
(111) (22) (23) (24) (25)
(112) (113) (33) (34)
(1111) (122) (114) (115)
(1112) (123) (124)
(11111) (132) (133)
(222) (142)
(1113) (223)
(1122) (1114)
(11112) (1123)
(111111) (1132)
(1222)
(11113)
(11122)
(111112)
(1111111)
MATHEMATICA
Table[Length[Select[Join@@Permutations /@ IntegerPartitions[n], Less@@First/@Split[#, LessEqual]&]], {n, 0, 15}]
CROSSREFS
Types of runs (instead of weakly increasing):
- For leaders of constant runs we have A000041.
- For leaders of anti-runs we have A374679.
- For leaders of strictly increasing runs we have A374688.
- For leaders of strictly decreasing runs we have A374762.
Types of run-leaders (instead of strictly increasing):
- For strictly decreasing leaders we appear to have A188920.
- For weakly decreasing leaders we appear to have A189076.
- For identical leaders we have A374631.
- For weakly increasing leaders we have A374635.
A003242 counts anti-run compositions.
A011782 counts compositions.
A335456 counts patterns matched by compositions.
A374637 counts compositions by sum of leaders of weakly increasing runs.
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Jul 23 2024
STATUS
approved