OFFSET
0,3
COMMENTS
The leaders of strictly increasing runs in a sequence are obtained by splitting it into maximal strictly increasing subsequences and taking the first term of each.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 0..1000
EXAMPLE
The composition (2,3,2,2,3,4) has strictly increasing runs ((2,3),(2),(2,3,4)), with leaders (2,2,2), so is counted under a(16).
The a(0) = 1 through a(6) = 17 compositions:
() (1) (2) (3) (4) (5) (6)
(11) (12) (13) (14) (15)
(111) (22) (23) (24)
(112) (113) (33)
(121) (131) (114)
(1111) (1112) (123)
(1121) (141)
(1211) (222)
(11111) (1113)
(1131)
(1212)
(1311)
(11112)
(11121)
(11211)
(12111)
(111111)
MATHEMATICA
Table[Length[Select[Join @@ Permutations/@IntegerPartitions[n], SameQ@@First/@Split[#, Less]&]], {n, 0, 15}]
PROG
(PARI) seq(n) = Vec(1 + sum(k=1, n, 1/(1 - x^k*prod(j=k+1, n-k, 1 + x^j, 1 + O(x^(n-k+1))))-1)) \\ Andrew Howroyd, Jul 27 2024
CROSSREFS
Ranked by A374685.
Types of runs (instead of strictly increasing):
Types of run-leaders (instead of identical):
- For strictly increasing leaders we have A374688.
- For strictly decreasing leaders we have A374689.
- For weakly increasing leaders we have A374690.
- For weakly decreasing leaders we have A374697.
A011782 counts compositions.
A335456 counts patterns matched by compositions.
A374683 lists leaders of strictly increasing runs of standard compositions.
A374700 counts compositions by sum of leaders of strictly increasing runs.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Jul 27 2024
EXTENSIONS
a(26) onwards from Andrew Howroyd, Jul 27 2024
STATUS
approved