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.

A357187 First differences A357186 = "Take the k-th composition in standard order for each part k of the n-th composition in standard order, then add up everything.".

Original entry on oeis.org

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

Views

Author

Gus Wiseman, Sep 28 2022

Keywords

Comments

Are there any terms > 1?
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

			We have A357186(5) - A357186(4) = 3 - 2 = 1, so a(4) = 1.
		

Crossrefs

See link for sequences related to standard compositions.
Positions of first appearances appear to all belong to A052955.
Differences of A357186 (row-sums of A357135).
The version for partitions is A357458, differences of A325033.

Programs

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

Formula

a(n) = A357186(n + 1) - A357186(n).