%I A064288
%S A064288 1,2,2,7,7,3,3,4,4,4,4,4,4,5,5,5,5,5,18,5,5,5,5,5,5,6,6,6,6,6,6,6,6,
%T A064288 6,6,6,6,6,6,7,6,6,6,6,6,6,8,8,8,8,8,8,8,8,8,8,8,8,8,8,19,7,7,7,7,7,
%U A064288 7,7,7,7,7,7,7,7,7,19,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,9,9,9,9,9,9,9,9
%N A064288 Height of n when it appears for first time in Recaman's sequence A005132.
%C A064288 The height of a term in A005132 = number of addition steps - number of 
               subtraction steps to produce it.
%H A064288 <a href="Sindx_Rea.html#Recaman">Index entries for sequences related 
               to Recaman's sequence</a>
%H A064288 N. J. A. Sloane, <a href="a005132.txt">FORTRAN program for A005132, A057167, 
               A064227, A064228</a>
%e A064288 A005132 begins 1, 3, 6, 2, 7, 13, 20, 12, ... and these terms have heights 
               1, 2, 3, 2, 3, 4, 5, 4, ...
%Y A064288 Cf. A005132, A064289, A064290 - A064294.
%Y A064288 Sequence in context: A126851 A142070 A152825 this_sequence A054085 A021443 
               A045923
%Y A064288 Adjacent sequences: A064285 A064286 A064287 this_sequence A064289 A064290 
               A064291
%K A064288 nonn
%O A064288 1,2
%A A064288 N. J. A. Sloane (njas(AT)research.att.com), Sep 25 2001