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.

A358133 Triangle read by rows whose n-th row lists the first differences of the n-th composition in standard order (row n of A066099).

Original entry on oeis.org

0, -1, 1, 0, 0, -2, 0, -1, 0, 2, 1, -1, 0, 1, 0, 0, 0, -3, -1, -2, 0, 1, 0, -1, -1, 1, -1, 0, 0, 3, 2, -2, 1, 0, 1, -1, 0, 0, 2, 0, 1, -1, 0, 0, 1, 0, 0, 0, 0, -4, -2, -3, 0, 0, -1, -1, -2, 1, -2, 0, 0, 2, 1, -2, 0, 0, 0, -1, 0, -1, 2, -1, 1, -1, -1, 0, 1, -1
Offset: 3

Views

Author

Gus Wiseman, Oct 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

			Triangle begins (dots indicate empty rows):
   1:   .
   2:   .
   3:   0
   4:   .
   5:  -1
   6:   1
   7:   0  0
   8:   .
   9:  -2
  10:   0
  11:  -1  0
  12:   2
  13:   1 -1
  14:   0  1
  15:   0  0  0
		

Crossrefs

See link for sequences related to standard compositions.
First differences of rows of A066099.
The version for Heinz numbers of partitions is A355536, ranked by A253566.
The partial sums instead of first differences are A358134.
Row sums are A358135.
A011782 counts compositions.
A351014 counts distinct runs in standard compositions.

Programs

  • Mathematica
    stc[n_]:=Differences[Prepend[Join @@ Position[Reverse[IntegerDigits[n,2]],1],0]]//Reverse;
    Table[Differences[stc[n]],{n,100}]