OFFSET
1,1
COMMENTS
The first sums of a nonempty sequence (a, b, c, d, ...) are (a+b, b+c, c+d, ...).
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.
Also numbers k such that there is some integer b such that the b-based partial alternating sums of the k-th composition in standard order are all > 1. Here, the b-based partial alternating sums of a finite sequence q are given by pas(q,b)_j = (-1)^j * b + Sum_{i=1..j} (-1)^(i+j) * q_i. This is a signed version of the partial sums transformation, inverse to the "first sums" transformation.
EXAMPLE
The 8464-th composition in standard order is (5,4,5), which is the first sums of (3,2,2,3), so 8464 is in the sequence.
The terms together with standard compositions begin:
8: (4)
16: (5)
32: (6)
64: (7)
128: (8)
136: (4,4)
256: (9)
264: (5,4)
272: (4,5)
512: (10)
520: (6,4)
528: (5,5)
544: (4,6)
MATHEMATICA
stc[n_]:=Differences[Prepend[Join @@ Position[Reverse[IntegerDigits[n, 2]], 1], 0]]//Reverse;
pas[y_, k_]:= Table[(-1)^j*k+Sum[(-1)^(i+j)*y[[i]], {i, j}], {j, 0, Length[y]}];
nag[m_]:=Select[Table[pas[m, b], {b, 1, Max[m]}], Min@@#>1&]!={};
Select[Range[1000], nag[stc[#]]&]
CROSSREFS
A011782 counts compositions.
A066099 lists all compositions in standard order.
A357213 counts compositions by sum of first sums.
A390432 lists first sums of standard compositions.
A390678 ranks compositions with no 1's that are not first sums.
A391642 counts compositions with standard first sums.
For nonnegative sequences we have:
For compositions (allowing 1's) we have:
KEYWORD
nonn
AUTHOR
Gus Wiseman, Jan 07 2026
STATUS
approved
