|
|
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."
|
|
7
|
|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,32
|
|
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.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
|
|
MATHEMATICA
|
stc[n_]:=Differences[Prepend[Join @@ Position[Reverse[IntegerDigits[n, 2]], 1], 0]]//Reverse;
Differences[Table[stc/@stc[n]/.List->Plus, {n, 0, 100}]]
|
|
CROSSREFS
|
See link for sequences related to standard compositions.
Positions of first appearances appear to all belong to A052955.
|
|
KEYWORD
|
sign
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|