OFFSET
1,2
COMMENTS
We define the run-compression of a sequence to be the anti-run obtained by reducing each run of repeated parts to a single part. Alternatively, run-compression removes all parts equal to the part immediately to their left. For example, (1,1,2,2,1) has run-compression (1,2,1).
EXAMPLE
The sequence of prime-powers (A246655) is:
2, 3, 4, 5, 7, 8, 9, 11, 13, 16, 17, 19, 23, 25, 27, 29, 31, 32, 37, ...
The sequence of first differences (A057820) of prime-powers is:
1, 1, 1, 2, 1, 1, 2, 2, 3, 1, 2, 4, 2, 2, 2, 2, 1, 5, 4, 2, 4, 2, 4, ...
The run-compression is A376308 (this sequence).
MATHEMATICA
First/@Split[Differences[Select[Range[100], PrimePowerQ]]]
CROSSREFS
For squarefree numbers instead of prime-powers we have A376305.
For run-lengths instead of compression we have A376309.
For run-sums instead of compression we have A376310.
A373948 encodes compression using compositions in standard order.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Sep 20 2024
STATUS
approved