|
|
A374684
|
|
Sum of leaders of strictly increasing runs in the n-th composition in standard order.
|
|
13
|
|
|
0, 1, 2, 2, 3, 3, 1, 3, 4, 4, 4, 4, 1, 2, 2, 4, 5, 5, 5, 5, 2, 5, 3, 5, 1, 2, 3, 3, 2, 3, 3, 5, 6, 6, 6, 6, 6, 6, 4, 6, 2, 3, 6, 6, 3, 4, 4, 6, 1, 2, 3, 3, 1, 4, 2, 4, 2, 3, 4, 4, 3, 4, 4, 6, 7, 7, 7, 7, 7, 7, 5, 7, 3, 7, 7, 7, 4, 5, 5, 7, 2, 3, 4, 4, 4, 7, 5
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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
|
|
|
EXAMPLE
|
The maximal strictly increasing subsequences of the 1234567th composition in standard order are ((3),(2),(1,2),(2),(1,2,5),(1),(1),(1)) with leaders (3,2,1,2,1,1,1,1), so a(1234567) = 12.
|
|
MATHEMATICA
|
stc[n_]:=Differences[Prepend[Join @@ Position[Reverse[IntegerDigits[n, 2]], 1], 0]]//Reverse;
Table[Total[First/@Split[stc[n], Less]], {n, 0, 100}]
|
|
CROSSREFS
|
All of the following pertain to compositions in standard order:
- Run-compression transform is A373948.
- Ranks of non-contiguous compositions are A374253, counted by A335548.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|