This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A333400 #26 Aug 22 2021 00:16:29 %S A333400 0,-1,-2,1,-3,-4,2,3,5,4,6,-5,7,-6,8,-7,9,-8,10,-9,11,12,-10,-11,13, %T A333400 14,-12,-13,15,16,-14,-15,18,-16,17,19,-17,20,-19,-18,21,22,-20,-21, %U A333400 24,-22,23,25,-23,26,-24,-25,27,28,-26,-27,30,-28,29,31,-29,32 %N A333400 Lexicographically earliest infinite sequence of distinct integers whose partial sums are all distinct integers. %C A333400 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). %C A333400 We organize lexicographically by magnitude, i.e., a precedes b if |a| < |b|; if |a| = |b|, then a precedes b if a < b. %C A333400 Conjecture: This is a permutation of the integers. %H A333400 Alec Jones, <a href="/A333400/b333400.txt">Table of n, a(n) for n = 1..1000</a> %Y A333400 Cf. A333398, the partial sums of this sequence. %Y A333400 Cf. A328190 and A327460 for similar constructions. %K A333400 sign %O A333400 1,3 %A A333400 _Alec Jones_, Mar 18 2020