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 A361189 #14 Dec 22 2024 14:27:47
%S A361189 1,2,-1,-4,-3,-6,4,-11,5,6,7,8,-8,-12,9,21,-10,-13,12,25,13,16,-14,31,
%T A361189 -15,-17,19,33,-19,-21,22,41,-22,-24,24,49,-25,-26,-27,-28,28,34,-29,
%U A361189 61,-30,-31,-33,-34,35,39,-35,75,-36,-37,38,77,-38,-39,-41,-42
%N A361189 Infinite sequence of nonzero integers build the greedy way such that the sums Sum_{i = k*2^e..(k+1)*2^e} a(i) with k, e >= 0 are all distinct; each term is minimal in absolute value and in case of a tie, preference is given to the positive value.
%C A361189 This sequence is a variant of A361144 where we allows negative values.
%C A361189 In order for the sequence to be infinite, zero sums are forbidden.
%C A361189 We can arrange the terms of the sequence as the leaves of a perfect infinite binary tree, the sums with e > 0 corresponding to parent nodes; each node will contain a different value and all nonzero values will appear in the tree.
%H A361189 Rémy Sigrist, <a href="/A361189/b361189.txt">Table of n, a(n) for n = 1..10000</a>
%H A361189 Rémy Sigrist, <a href="/A361189/a361189.txt">C++ program</a>
%e A361189 The first terms (at the bottom of the tree) alongside the corresponding sums are:
%e A361189 18
%e A361189 ---------------------------------
%e A361189 -18 36
%e A361189 ----------------- -----------------
%e A361189 -2 -16 26 10
%e A361189 --------- --------- --------- ---------
%e A361189 3 -5 -9 -7 11 15 -20 30
%e A361189 ----- ----- ----- ----- ----- ----- ----- -----
%e A361189 1 2 -1 -4 -3 -6 4 -11 5 6 7 8 -8 -12 9 21
%o A361189 (C++) // See Links section.
%Y A361189 Cf. A361144.
%K A361189 sign
%O A361189 1,2
%A A361189 _Rémy Sigrist_, Mar 03 2023