OFFSET
1,3
COMMENTS
This sequence is infinite. Consider first n partial sums; a distinct partial sum can always be formed by choosing a sufficiently large integer for a(n+1).
We organize lexicographically by magnitude, i.e., a precedes b if |a| < |b|; if |a| = |b|, then a precedes b if a < b.
Conjecture: This is a permutation of the integers.
LINKS
Alec Jones, Table of n, a(n) for n = 1..1000
CROSSREFS
KEYWORD
sign
AUTHOR
Alec Jones, Mar 18 2020
STATUS
approved