%I A080034
%S A080034 1,3,4,7,11,6,15,19,9,23,12,27,31,14,35,39,17,43,20,47,51,22,55,59,25,
%T A080034 63,28,67,71,30,75,79,33,83,36,87,91,38,95,99,41,103,44,107,111,46,115,
%U A080034 119,49,123,52,127,131,54,135,139,57,143,60,147,151,62,155,159,65,163
%N A080034 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 congruent to 3 mod 4".
%H A080034 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 A080034 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)
%Y A080034 Equals A080033(n+1)-1.
%Y A080034 Sequence in context: A143607 A032715 A002887 this_sequence A061447 A080591 
               A047543
%Y A080034 Adjacent sequences: A080031 A080032 A080033 this_sequence A080035 A080036 
               A080037
%K A080034 easy,nonn
%O A080034 0,2
%A A080034 N. J. A. Sloane (njas(AT)research.att.com), Mar 14 2003
%E A080034 More terms from Matthew Vandermast (ghodges14(AT)comcast.net), Mar 23 
               2003