cp's OEIS Frontend

A316995 Sequence of distinct signed integers such that a(1) = 0 and for any n > 0, a(n+1) is of the form a(n) + (-2)^k (where k >= 0) and has the smallest possible absolute value (in case of a tie, minimize k).

%I A316995 #8 Jul 28 2018 10:56:53
%S A316995 0,1,-1,-3,-2,2,3,4,-4,-6,-5,-7,-9,7,5,6,10,8,9,13,11,12,16,14,15,-17,
%T A316995 -13,-12,-8,-10,-18,-14,-16,-15,-11,-19,-21,-20,-22,-24,-23,-25,-27,
%U A316995 -26,-28,-30,-29,-31,-33,31,23,21,19,17,18,22,20,24,25,26,27,28
%N A316995 Sequence of distinct signed integers such that a(1) = 0 and for any n > 0, a(n+1) is of the form a(n) + (-2)^k (where k >= 0) and has the smallest possible absolute value (in case of a tie, minimize k).
%C A316995 This sequence is likely to contain every signed integer.
%H A316995 Rémy Sigrist, <a href="/A316995/a316995.gp.txt">PARI program for A316995</a>
%e A316995 The first terms, alongside the value k such that a(n+1) = a(n) + (-2)^k, are:
%e A316995   n  a(n)   k
%e A316995   -- ----   --
%e A316995    1    0    0
%e A316995    2    1    1
%e A316995    3   -1    1
%e A316995    4   -3    0
%e A316995    5   -2    2
%e A316995    6    2    0
%e A316995    7    3    0
%e A316995    8    4    3
%e A316995    9   -4    1
%e A316995   10   -6    0
%e A316995   11   -5    1
%e A316995   12   -7    1
%e A316995   13   -9    4
%e A316995   14    7    1
%e A316995   15    5    0
%e A316995   16    6    2
%e A316995   17   10    1
%e A316995   18    8    0
%e A316995   19    9    2
%e A316995   20   13    1
%o A316995 (PARI) See Links section.
%Y A316995 Cf. A122803.
%K A316995 sign
%O A316995 1,4
%A A316995 _Rémy Sigrist_, Jul 18 2018