cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A356841 Numbers k such that the k-th composition in standard order covers an interval of positive integers (gapless).

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 13, 14, 15, 16, 18, 20, 21, 22, 23, 26, 27, 29, 30, 31, 32, 36, 37, 38, 41, 42, 43, 44, 45, 46, 47, 50, 52, 53, 54, 55, 58, 59, 61, 62, 63, 64, 68, 72, 74, 75, 77, 78, 82, 83, 84, 85, 86, 87, 89, 90, 91, 92, 93, 94, 95, 101
Offset: 1

Views

Author

Gus Wiseman, Aug 31 2022

Keywords

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.

Examples

			The terms and their corresponding standard compositions begin:
   0: ()
   1: (1)
   2: (2)
   3: (1,1)
   4: (3)
   5: (2,1)
   6: (1,2)
   7: (1,1,1)
   8: (4)
  10: (2,2)
  11: (2,1,1)
  13: (1,2,1)
  14: (1,1,2)
  15: (1,1,1,1)
  16: (5)
  18: (3,2)
  20: (2,3)
  21: (2,2,1)
		

Crossrefs

See link for sequences related to standard compositions.
An unordered version is A073491, complement A073492.
These compositions are counted by A107428.
The complement is A356842.
The non-initial case is A356843, unordered A356845.
A356230 ranks gapless factorization lengths, firsts A356603.
A356233 counts factorizations into gapless numbers.
A356844 ranks compositions with at least one 1.

Programs

  • Mathematica
    nogapQ[m_]:=m=={}||Union[m]==Range[Min[m],Max[m]];
    stc[n_]:=Differences[Prepend[Join@@ Position[Reverse[IntegerDigits[n,2]],1],0]]//Reverse;
    Select[Range[0,100],nogapQ[stc[#]]&]