Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #10 Jun 08 2022 16:39:35
%S 1,2,5,4,8,11,7,14,17,10,20,23,13,26,29,16,32,35,19,38,41,22,44,47,25,
%T 50,53,28,56,59,31,62,65,34,68,71,37,74,77,40,80,83,43,86,89,46,92,95,
%U 49,98,101,52,104,107,55,110,113,58,116,119,61,122,125,64,128,131,67
%N 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 2 mod 3".
%C A permutation of all positive non-multiples of 3; also a permutation of A080030. - _Matthew Vandermast_, Mar 21 2003
%H 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 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 a(3m)=3m+1, a(3m+1)=6m+2, a(3m+2)=6m+5. [corrected by _Georg Fischer_, Jun 08 2022]
%Y Cf. A079000, A079313, A080029, A080030.
%K easy,nonn
%O 0,2
%A _N. J. A. Sloane_, Mar 14 2003
%E More terms from _Matthew Vandermast_, Mar 21 2003