%I
%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,5,6,5,6,5,6,7,8,
%T 7,8,7,6,7,6,7,6,7,6,7,6,7,6,7,6,7,6,7,6,7,6,7,6,7,6,7,6,7,6,7,8,9,8,
%U 9,8,9,8,9,8,9,8,7,8,7,8,7,8,7,8,7,8,7,8,7,8,7,8,7,8,7,8,7,8,7
%N Height of nth term in Recamán's sequence A005132.
%C The height of a term in A005132 = number of addition steps  number of subtraction steps to produce it.
%H Nick Hobson, <a href="/A064289/a064289.py.txt">Python program for this sequence</a>
%H N. J. A. Sloane, <a href="/A005132/a005132.txt">FORTRAN program for A005132, A057167, A064227, A064228</a>
%H <a href="/index/Rea#Recaman">Index entries for sequences related to Recamán's sequence</a>
%e A005132 begins 1, 3, 6, 2, 7, 13, 20, 12, ... and these terms have heights 1, 2, 3, 2, 3, 4, 5, 4, ...
%Y Cf. A005132, A064288, A064290, A064292, A064293, A064294.
%K nonn
%O 1,2
%A _N. J. A. Sloane_, Sep 25 2001
