cp's OEIS Frontend

A080031 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".

%I A080031 #10 Jun 08 2022 16:39:35
%S A080031 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 A080031 50,53,28,56,59,31,62,65,34,68,71,37,74,77,40,80,83,43,86,89,46,92,95,
%U A080031 49,98,101,52,104,107,55,110,113,58,116,119,61,122,125,64,128,131,67
%N A080031 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 A080031 A permutation of all positive non-multiples of 3; also a permutation of A080030. - _Matthew Vandermast_, Mar 21 2003
%H A080031 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 A080031 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 A080031 a(3m)=3m+1, a(3m+1)=6m+2, a(3m+2)=6m+5. [corrected by _Georg Fischer_, Jun 08 2022]
%Y A080031 Cf. A079000, A079313, A080029, A080030.
%K A080031 easy,nonn
%O A080031 0,2
%A A080031 _N. J. A. Sloane_, Mar 14 2003
%E A080031 More terms from _Matthew Vandermast_, Mar 21 2003