|
%I #11 Apr 13 2020 19:50:08
%S 4,6,8,11,12,13,14,17,18,20,23,29,31,37,38,39,41,43,44,47,48,49,53,54,
%T 55,56,57,58,59,60,61,62,63,64,65,66,67,71,73,74,79,80,83,89,90,91,97,
%U 101,103,104,105,106,107,109,113,127,131,137,139,149,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 prime".
%H Rémy Sigrist, <a href="/A079254/b079254.txt">Table of n, a(n) for n = 1..10000</a>
%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(1) cannot be 1 because 1 is not prime; it cannot be 2, for then 1 is not in the sequence while a(1) is prime; nor can it be 3; but 4 is possible.
%o (PARI) s=0; n=1; for (v=2, 167, if (bitxor(bittest(s,n), !isprime(v)), print1 (v", "); n++; s+=2^v)) \\ _Rémy Sigrist_, Apr 13 2020
%Y Cf. A079000.
%K nonn
%O 1,1
%A _Matthew Vandermast_ and _N. J. A. Sloane_, Feb 01 2003
|
