|
%I #7 Mar 30 2012 17:27:18
%S 1,6,12,20,30,41,54,70,88,108,130,153,178,206,236,268,302,338,376,415,
%T 456,500,546,594,644,696,750,806,864,923,984,1048,1114,1182,1252,1324,
%U 1398,1474,1552,1632,1713,1796,1882,1970,2060,2152,2246,2342,2440,2540
%N a(n) is taken to be the (n-th)-smallest positive integer greater than a(n-1) that is consistent with the condition "n is a member of the sequence if and only if a(n) is odd.".
%H B. Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL6/Cloitre/cloitre2.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)
%e a(2) cannot be 2 because that would require the second term to be odd, a condition 2 does not satisfy. Since 2 is therefore not in the sequence, the second term must be even. The second-smallest even number greater than 2 is 6; therefore a(2) is 6.
%Y Cf. A079000.
%K nonn
%O 1,2
%A _Matthew Vandermast_, Mar 05 2003
|
