%I A063733
%S A063733 1,1,2,4,7,3,8,14,21,13,22,12,23,11,24,10,25,9,26,44,63,43,64,42,19,
%T A063733 43,18,44,17,45,16,46,15,47,80,114,79,115,78,40,79,39,80,38,81,
%U A063733 37,82,36,83,35,84,34,85,33,86,32,87,31,88,30,89,29,90,28,91,27
%N A063733 A variant of Recaman's sequence: a(0)=1, a(n) = a(n-1)-(n-1) if positive 
               and new, else a(n) = a(n-1)+(n-1).
%H A063733 R. Zumkeller, <a href="b063733.txt">Table of n, a(n) for n = 0..10000</
               a>
%H A063733 <a href="Sindx_Rea.html#Recaman">Index entries for sequences related 
               to Recaman's sequence</a>
%Y A063733 See A005132, which is the main entry for this sequence. A063753 = 1 + 
               A005132. A row of A066201. Also a row of A066202.
%Y A063733 See also A078943.
%Y A063733 Cf. A141126.
%Y A063733 Sequence in context: A081145 A100707 A078943 this_sequence A141330 A114375 
               A129200
%Y A063733 Adjacent sequences: A063730 A063731 A063732 this_sequence A063734 A063735 
               A063736
%K A063733 nonn,nice,easy
%O A063733 0,3
%A A063733 N. J. A. Sloane (njas(AT)research.att.com), Sep 05 2001