|
%I #12 May 14 2015 12:52:07
%S 0,1,2,-1,3,4,-2,-3,6,-4,5,7,-5,8,-6,-7,9,10,-8,11,-10,12,-9,-11,13,
%T 14,-13,-12,15,16,-14,-15,17,18,-16,19,-17,20,-19,21,-18,22,-20,-21,
%U 24,-22,23,25,-23,26,-25,27,-24,28,-26,-27,30,29,-31,32,-28,31,-29,33,-30,34,-32,-33,35,36,-34
%N Sequence (d(n)) generated by Rule 1 (see Comments) with a(1) = 1 and d(1) = 0.
%C Rule 1 is given at A131388. Conjecture: Every integer occurs exactly once in A131389.
%H Clark Kimberling, <a href="/A131389/b131389.txt">Table of n, a(n) for n = 1..1000</a>
%F This is the sequence d( ) in the formula for A131388.
%e See A131388.
%t See A131388.
%Y Cf. A131388, A131390, A131391, A131392, A131393, A131394, A131395, A131396, A131397.
%K sign
%O 1,3
%A _Clark Kimberling_, Jul 05 2007
%E Definition clarified by _Clark Kimberling_, May 12 2015
|
