%I #8 Oct 30 2022 18:19:59
%S 1,2,3,2,3,4,5,4,5,4,5,4,5,4,5,4,5,6,7,6,7,6,5,6,5,6,7,8,7,8,7,6,5,6,
%T 5,6,7,8,7,6,7,8,9,8,7,6,7,6,7,6,7,8,9,8,9,8,7,6,7,8,9,8,9,8,9,8,9,8,
%U 7,8,9,10,9,10,9,8,7,8,7,8,9,10,9,10,9,10,9,8,9,10,11,10,11,10,9,8,9,8,9,10
%N Height of n-th term in A064389 (variation (4) of Recamán's sequence).
%H Nick Hobson, <a href="/A078759/b078759.txt">Table of n, a(n) for n=1..10000</a>
%H Nick Hobson, <a href="/A078759/a078759.py.txt">Python program for this sequence</a>
%F The height of a term in A064389 = number of addition steps - number of subtraction steps to produce it.
%Y Cf. A005132, A064289, A064389.
%K nonn
%O 1,2
%A _Reiner Martin_, Jan 08 2003