%I A064388
%S A064388 1,3,6,2,7,13,20,12,21,11,22,10,23,9,24,8,25,43,62,42,63,41,18,44,17,
%T A064388 45,16,46,15,47,14,48,83,119,82,120,81,121,80,38,84,37,85,36,86,35,87,
%U A064388 34,88,33,89,32,90,31,91,30,92,29,93,28,94,27,95,26,96,167,239,166,240
%N A064388 Variation (3) on Recaman's sequence (A005132): set s (the step size) 
               initially equal to 2; to get a(n), we first try to subtract s from 
               a(n-1): a(n) = a(n-1)-s if positive and not already in the sequence, 
               in which case we change s to s+1; if not, a(n) = a(n-1)+s+i, where 
               i >= 0 is the smallest number such that a(n-1)+s+i has not already 
               appeared and now we change s to s+i+1
%C A064388 Variation (4) (A064389) is the nicest of these variations.
%C A064388 I would also like to get the following sequences: number of steps before 
               n appears (or 0 if n never appears), list of numbers that never appear, 
               height of n (cf. A064288, A064289, A064290), etc.
%H A064388 <a href="Sindx_Rea.html#Recaman">Index entries for sequences related 
               to Recaman's sequence</a>
%Y A064388 Cf. A005132, A046901, A064387, A064389.
%Y A064388 Sequence in context: A074170 A076543 A005132 this_sequence A064387 A064389 
               A118201
%Y A064388 Adjacent sequences: A064385 A064386 A064387 this_sequence A064389 A064390 
               A064391
%K A064388 nonn,easy
%O A064388 1,2
%A A064388 N. J. A. Sloane (njas(AT)research.att.com), Sep 28 2001
%E A064388 More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Jul 16 
               2002