|
%I #5 Mar 30 2012 17:29:19
%S 1,2,3,6,8,11,12,13,14,15,17,19,23,29,31,32,37,38,41,42,44,45,47,48,
%T 49,50,51,52,53,54,59,61,62,63,64,65,67,71,72,74,79,83,84,89,97,98,
%U 101,103,107,109,113,127,131,137,138,140,141,142,149,150,151,157,163,167
%N a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is not composite".
%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)
%e a(4) cannot be 4 because 4 is composite; it cannot be 5, for then 4 is not in the sequence while a(4) is not composite; but 6 is possible.
%Y Cf. A079000, A079254, A085925, A099797.
%K nonn
%O 1,2
%A _Ray Chandler_, Nov 02 2004
|
