[go: up one dir, main page]

login
A354906 revision #2

A354906
Position of first appearance of n in A354579 = Number of distinct run-lengths of standard compositions.
1
0, 1, 11, 119, 5615, 251871
OFFSET
0,3
COMMENTS
The k-th composition in standard order (graded reverse-lexicographic, A066099) is obtained by taking the set of positions of 1's in the reversed binary expansion of k, prepending 0, taking first differences, and reversing again. This gives a bijective correspondence between nonnegative integers and integer compositions.
EXAMPLE
The terms together with their corresponding compositions begin:
0: ()
1: (1)
11: (2,1,1)
119: (1,1,2,1,1,1)
5615: (2,2,1,1,1,2,1,1,1,1)
251871: (1,1,1,2,2,1,1,1,1,2,1,1,1,1,1)
MATHEMATICA
stc[n_]:=Differences[Prepend[Join@@Position[Reverse[IntegerDigits[n, 2]], 1], 0]]//Reverse;
pd=Table[Length[Union[Length/@Split[stc[n]]]], {n, 0, 10000}];
Table[Position[pd, n][[1, 1]]-1, {n, 0, Max@@pd}]
CROSSREFS
The standard compositions used here are A066099, run-sums A353847/A353932.
The version for partitions is A006939, for run-sums A002110.
For run-sums instead of run-lengths we have A246534 (first appearances in A353849).
For runs instead of run-lengths we have A351015, firsts of A351014.
These are the positions of first appearances in A354579.
`A003242 counts anti-run compositions, ranked by A333489.
A005811 counts runs in binary expansion.
A333627 ranks the run-lengths of standard compositions.
A351596 ranks compositions with distinct run-lengths, counted by A329739.
`A353744 ranks compositions with equal run-lengths, counted by A329738.
A353852 ranks compositions with distinct run-sums, counted by A353850.
A353853-A353859 are sequences pertaining to composition run-sum trajectory.
A353860 counts collapsible compositions.
Sequence in context: A125468 A163447 A254600 * A060499 A164828 A060498
KEYWORD
nonn,changed
AUTHOR
Gus Wiseman, Jun 23 2022
STATUS
editing