A351291 Numbers k such that the k-th composition in standard order does not have all distinct runs.
13, 22, 25, 45, 46, 49, 53, 54, 59, 76, 77, 82, 89, 91, 93, 94, 97, 101, 102, 105, 108, 109, 110, 115, 118, 141, 148, 150, 153, 156, 162, 165, 166, 173, 177, 178, 180, 181, 182, 183, 187, 189, 190, 193, 197, 198, 201, 204, 205, 209, 210, 213, 214, 216, 217
Offset: 1
Keywords
Examples
The terms together with their binary expansions and corresponding compositions begin: 13: 1101 (1,2,1) 22: 10110 (2,1,2) 25: 11001 (1,3,1) 45: 101101 (2,1,2,1) 46: 101110 (2,1,1,2) 49: 110001 (1,4,1) 53: 110101 (1,2,2,1) 54: 110110 (1,2,1,2) 59: 111011 (1,1,2,1,1) 76: 1001100 (3,1,3) 77: 1001101 (3,1,2,1) 82: 1010010 (2,3,2) 89: 1011001 (2,1,3,1) 91: 1011011 (2,1,2,1,1) 93: 1011101 (2,1,1,2,1) 94: 1011110 (2,1,1,1,2)
Links
- Mathematics Stack Exchange, What is a sequence run? (answered 2011-12-01)
Crossrefs
Normal multisets with a permutation of this type appear to be A283353.
A011782 counts integer compositions.
A044813 lists numbers whose binary expansion has all distinct run-lengths.
Counting words with all distinct runs:
- A351202 = permutations of prime factors.
- Length is A000120.
- Sum is A070939.
- Heinz number is A333219.
- Number of distinct parts is A334028.
Selected classes of standard compositions:
- 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],!UnsameQ@@Split[stc[#]]&]
Comments