A375295 Numbers k such that the leaders of maximal weakly increasing runs in the k-th composition in standard order (row k of A066099) are not strictly decreasing.
13, 25, 27, 29, 45, 49, 50, 51, 53, 54, 55, 57, 59, 61, 77, 82, 89, 91, 93, 97, 98, 99, 101, 102, 103, 105, 107, 108, 109, 110, 111, 113, 114, 115, 117, 118, 119, 121, 123, 125, 141, 153, 155, 157, 162, 165, 173, 177, 178, 179, 181, 182, 183, 185, 187, 189
Offset: 1
Keywords
Examples
The sequence together with corresponding compositions begins: 13: (1,2,1) 25: (1,3,1) 27: (1,2,1,1) 29: (1,1,2,1) 45: (2,1,2,1) 49: (1,4,1) 50: (1,3,2) 51: (1,3,1,1) 53: (1,2,2,1) 54: (1,2,1,2) 55: (1,2,1,1,1) 57: (1,1,3,1) 59: (1,1,2,1,1) 61: (1,1,1,2,1) 77: (3,1,2,1) 82: (2,3,2) 89: (2,1,3,1) 91: (2,1,2,1,1) 93: (2,1,1,2,1)
Links
- Wikipedia, Permutation pattern.
- Gus Wiseman, Sequences counting and ranking compositions by their leaders (for six types of runs).
Crossrefs
For leaders of identical runs we have A335485.
The reverse version is A375296.
A011782 counts compositions.
A374637 counts compositions by sum of leaders of weakly increasing runs.
All of the following pertain to compositions in standard order:
- Length is A000120.
- Sum is A029837(n+1).
- Leader is A065120.
- Strict compositions are A233564.
- Constant compositions are A272919.
Programs
-
Mathematica
stc[n_]:=Differences[Prepend[Join @@ Position[Reverse[IntegerDigits[n,2]],1],0]]//Reverse; Select[Range[0,100],!Greater@@First/@Split[stc[#],LessEqual]&] - or - stc[n_]:=Differences[Prepend[Join @@ Position[Reverse[IntegerDigits[n,2]],1],0]]//Reverse; Select[Range[0,100],MatchQ[stc[#],{_,x_,_,z_,y_,_}/;x<=y
Comments