%I #5 Mar 30 2012 17:27:18
%S 2,5,8,12,15,18,22,25,28,32,36,39,42,46,49,52,56,59,62,66,70,73,76,80,
%T 83,86,90,93,96,100,104,107,110,114,118,121,124,128,131,134,138,141,
%U 144,148,152,155,158,162,165,168,172,175,178,182,186,189,192,196,199,202
%N a(1)=2; for n > 1, a is the second-smallest positive integer greater than a(n-1) such that the condition "n is in the sequence if and only if a(n) is odd" is satisfied.
%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)
%Y Cf. A079000.
%K easy,nonn
%O 1,1
%A _Matthew Vandermast_, Mar 08 2003