A374690 Number of integer compositions of n whose leaders of strictly increasing runs are weakly increasing.
1, 1, 2, 3, 6, 10, 19, 34, 63, 115, 211, 387, 710, 1302, 2385, 4372, 8009, 14671, 26867, 49196, 90069, 164884, 301812, 552406, 1011004, 1850209, 3385861, 6195832, 11337470, 20745337, 37959030, 69454669, 127081111, 232517129, 425426211, 778376479, 1424137721
Offset: 0
Keywords
Examples
The composition (1,1,3,2,3,2) has strictly increasing runs ((1),(1,3),(2,3),(2)), with leaders (1,1,2,2), so is counted under a(12). The a(0) = 1 through a(6) = 19 compositions: () (1) (2) (3) (4) (5) (6) (11) (12) (13) (14) (15) (111) (22) (23) (24) (112) (113) (33) (121) (122) (114) (1111) (131) (123) (1112) (132) (1121) (141) (1211) (222) (11111) (1113) (1122) (1131) (1212) (1311) (11112) (11121) (11211) (12111) (111111)
Links
- Christian Sievers, Table of n, a(n) for n = 0..500
- Gus Wiseman, Sequences counting and ranking compositions by their leaders (for six types of runs).
Crossrefs
Ranked by positions of weakly increasing rows in A374683.
Types of runs (instead of strictly increasing):
- For leaders of identical runs we have A000041.
- For leaders of anti-runs we have A374681.
- For leaders of weakly increasing runs we have A374635.
- For leaders of weakly decreasing runs we have A188900.
- For leaders of strictly decreasing runs we have A374764.
Types of run-leaders (instead of weakly increasing):
- For strictly increasing leaders we have A374688.
- For strictly decreasing leaders we have A374689.
- For weakly decreasing leaders we have A374697.
A011782 counts compositions.
A335456 counts patterns matched by compositions.
A374700 counts compositions by sum of leaders of strictly increasing runs.
Programs
-
Mathematica
Table[Length[Select[Join@@Permutations /@ IntegerPartitions[n],LessEqual@@First/@Split[#,Less]&]],{n,0,15}]
Extensions
a(26) and beyond from Christian Sievers, Aug 08 2024
Comments