OFFSET
0,7
COMMENTS
The leaders of maximal strictly increasing runs in a sequence are obtained by splitting it into maximal strictly increasing subsequences and taking the first term of each.
LINKS
EXAMPLE
The composition y = (1,2,1,3,2,3) has strictly increasing runs ((1,2),(1,3),(2,3)), with leaders (1,1,2), which are not weakly decreasing, so y is counted under a(12).
The a(0) = 0 through a(8) = 25 compositions:
. . . . . (122) (132) (133) (143)
(1122) (142) (152)
(1221) (1132) (233)
(1222) (1133)
(1321) (1142)
(2122) (1223)
(11122) (1232)
(11221) (1322)
(12211) (1331)
(1421)
(2132)
(3122)
(11132)
(11222)
(11321)
(12122)
(12212)
(12221)
(13211)
(21122)
(21221)
(111122)
(111221)
(112211)
(122111)
MATHEMATICA
Table[Length[Select[Join@@Permutations /@ IntegerPartitions[n], !GreaterEqual@@First/@Split[#, Less]&]], {n, 0, 15}]
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Aug 06 2024
STATUS
approved