login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


Least prime p such that the first n primes are not squares mod p.
3

%I #9 May 13 2013 01:49:36

%S 3,5,43,43,67,67,163,163,163,163,163,163,74093,170957,360293,679733,

%T 2004917,2004917,51599563,51599563,96295483,96295483,146161723,

%U 1408126003,1728061733,1728061733,1728061733,1728061733,1728061733,1728061733

%N Least prime p such that the first n primes are not squares mod p.

%C That is, the first n primes are quadratic non-residues mod p. A less restrictive form of A001992. Sequence A191088 is similar, but allows p to be composite. See A147972 for the square version.

%t Table[p = 2; While[Length[Select[Prime[Range[n]], JacobiSymbol[#, p] == -1 &]] < n, p = NextPrime[p]]; p, {n, 15}]

%o (PARI) q=2;forprime(k=3,1e9,forprime(p=2,q,if(kronecker(p,k)>=0,next(2)));print1(k", ");q=nextprime(q+1);k--) \\ _Charles R Greathouse IV_, Oct 10 2011

%Y Cf. A001992, A147972, A191088.

%K nonn

%O 1,1

%A _T. D. Noe_, May 25 2011

%E a(16)-a(30) from _Charles R Greathouse IV_, Oct 10 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 23 05:13 EDT 2024. Contains 376143 sequences. (Running on oeis4.)