login
a(1)=1; a(2)=8; for n > 2, a(n) is smallest integer greater than a(n-1) that satisfies the condition "n is in the sequence if and only if a(n) is odd.".
2

%I #5 Mar 30 2012 17:27:18

%S 1,8,10,12,14,16,18,19,20,21,22,23,24,25,26,27,28,29,31,33,35,37,39,

%T 41,43,45,47,49,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,

%U 69,70,71,72,73,75,77,79,81,83,85,87,89,91,93,95,97,99,101,103,105,107,109

%N a(1)=1; a(2)=8; for n > 2, a(n) is smallest integer greater than a(n-1) that satisfies the condition "n is in the sequence if and only if a(n) is odd.".

%C Increases according to a pattern analogous to the one for A079000.

%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, A080731.

%K easy,nonn

%O 1,2

%A _Matthew Vandermast_, Mar 08 2003