OFFSET
1,3
COMMENTS
Replace all even terms by a 0, odd terms by a 1. Consider now the minus signs as chunks' delimiters of concatenated 1's and 0's. The successive chunks are the binary equivalents of the sequence's term. This is the lexicographically earliest sequence having this property.
LINKS
Jean-Marc Falcoz, Table of n, a(n) for n = 1..50000
EXAMPLE
The sequence starts (plus signs added for readability):
0,-1,-3,+1,-5,-7,+2,+3,-9,+5,+7,-11,+4,-k,...
We replace every even term by 0, every odd term by 1:
0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, ...
The former minus signs now delimit the binary chunks:
0 (1) (11) (1) (101) (111) (10) ...
Binary to decimal rebuild S:
0 1 3 1 5 7 2 ...
CROSSREFS
KEYWORD
sign,base
AUTHOR
Eric Angelini and Jean-Marc Falcoz, Oct 05 2020
STATUS
approved