OFFSET
1,1
COMMENTS
A finite arithmetic progression is a sequence with all equal first differences.
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.
EXAMPLE
The terms together with corresponding standard compositions begin:
11: (2,1,1)
13: (1,2,1)
14: (1,1,2)
19: (3,1,1)
21: (2,2,1)
22: (2,1,2)
23: (2,1,1,1)
25: (1,3,1)
26: (1,2,2)
27: (1,2,1,1)
28: (1,1,3)
29: (1,1,2,1)
30: (1,1,1,2)
35: (4,1,1)
38: (3,1,2)
39: (3,1,1,1)
41: (2,3,1)
43: (2,2,1,1)
44: (2,1,3)
45: (2,1,2,1)
46: (2,1,1,2)
47: (2,1,1,1,1)
MATHEMATICA
stc[n_]:=Differences[Prepend[Join@@Position[Reverse[IntegerDigits[n, 2]], 1], 0]]//Reverse;
Select[Range[0, 100], !SameQ@@Differences[stc[#]]&]
CROSSREFS
KEYWORD
nonn
AUTHOR
Gus Wiseman, Oct 14 2025
STATUS
approved
