A351015 Smallest k such that the k-th composition in standard order has n distinct runs.
0, 1, 5, 27, 155, 1655, 18039, 281975
Offset: 0
Examples
The terms together with their binary expansions and corresponding compositions begin: 0: 0 () 1: 1 (1) 5: 101 (2,1) 27: 11011 (1,2,1,1) 155: 10011011 (3,1,2,1,1) 1655: 11001110111 (1,3,1,1,2,1,1,1) 18039: 100011001110111 (4,1,3,1,1,2,1,1,1) 281975: 1000100110101110111 (4,3,1,2,2,1,1,2,1,1,1)
Links
- Mathematics Stack Exchange, What is a sequence run? (answered 2011-12-01)
Crossrefs
The version for Heinz numbers and prime multiplicities is A006939.
Counting not necessarily distinct runs gives A113835 (up to zero).
Using binary expansions instead of standard compositions gives A350952.
These are the positions of first appearances in A351014.
A011782 counts integer compositions.
A044813 lists numbers whose binary expansion has distinct run-lengths.
Counting words with all distinct runs:
- Length is A000120.
- Sum is A070939.
- Runs are counted by A124767.
- Number of distinct parts is A334028.
Programs
-
Mathematica
stc[n_]:=Differences[Prepend[Join@@ Position[Reverse[IntegerDigits[n,2]],1],0]]//Reverse; s=Table[Length[Union[Split[stc[n]]]],{n,0,1000}]; Table[Position[s,k][[1,1]]-1,{k,Union[s]}]
Comments