%I A080032
%S A080032 0,2,4,1,6,7,8,10,12,11,14,16,18,15,20,22,24,19,26,28,30,23,32,34,36,27,
%T A080032 38,40,42,31,44,46,48,35,50,52,54,39,56,58,60,43,62,64,66,47,68,70,72,
%U A080032 51,74,76,78,55,80,82,84,59,86,88,90,63,92,94,96,67,98,100,102,71,104
%N A080032 a(n) is taken to be the smallest positive integer not already present 
               which is consistent with the condition "n is a member of the sequence 
               if and only if a(n) is even".
%H A080032 B. Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="http://www.cs.uwaterloo.ca/
               journals/JIS/index.html">Numerical analogues of Aronson's sequence</
               a>, J. Integer Seqs., Vol. 6 (2003), #03.2.2.
%H A080032 B. Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="http://arXiv.org/
               abs/math.NT/0305308">Numerical analogues of Aronson's sequence</a> 
               (math.NT/0305308)
%F A080032 For n >= 4 a(n) is given by: a(4m)=6m, a(4m+1)=4m+3, a(4m+2)=6m+2, a(4m+3)=6m+4.
%Y A080032 Cf. A079000, A080029, A080030. Equals A079313 - 1.
%Y A080032 Sequence in context: A138124 A128860 A019680 this_sequence A105357 A167546 
               A011369
%Y A080032 Adjacent sequences: A080029 A080030 A080031 this_sequence A080033 A080034 
               A080035
%K A080032 easy,nonn
%O A080032 0,2
%A A080032 N. J. A. Sloane (njas(AT)research.att.com), Mar 14 2003
%E A080032 More terms from Matthew Vandermast (ghodges14(AT)comcast.net), Mar 21 
               2003