OFFSET
0,3
COMMENTS
The leaders of strictly decreasing runs in a sequence are obtained by splitting it into maximal strictly decreasing subsequences and taking the first term of each.
LINKS
EXAMPLE
The composition (3,1,2,2,1) has strictly decreasing runs ((3,1),(2),(2,1)), with leaders (3,2,2), so is counted under a(9).
The a(0) = 1 through a(6) = 13 compositions:
() (1) (2) (3) (4) (5) (6)
(11) (21) (22) (32) (33)
(111) (31) (41) (42)
(211) (212) (51)
(1111) (221) (222)
(311) (312)
(2111) (321)
(11111) (411)
(2121)
(2211)
(3111)
(21111)
(111111)
MATHEMATICA
Table[Length[Select[Join@@Permutations /@ IntegerPartitions[n], GreaterEqual@@First/@Split[#, Greater]&]], {n, 0, 15}]
CROSSREFS
The opposite version is A374690.
Other types of runs (instead of strictly decreasing):
- For leaders of identical runs we have A000041.
- For leaders of weakly increasing runs we appear to have A189076.
- For leaders of anti-runs we have A374682.
- For leaders of strictly increasing runs we have A374697.
- For leaders of weakly decreasing runs we have A374747.
Other types of run-leaders (instead of weakly decreasing):
- For strictly increasing leaders we have A374762.
- For strictly decreasing leaders we have A374763.
- For weakly increasing leaders we have A374764.
A011782 counts compositions.
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Jul 30 2024
STATUS
approved