|
|
A001992
|
|
Let p = n-th odd prime. Then a(n) = least prime congruent to 5 modulo 8 such that Legendre(a(n), q) = -1 for all odd primes q <= p.
(Formerly M4012 N1663)
|
|
5
|
|
|
5, 53, 173, 173, 293, 2477, 9173, 9173, 61613, 74093, 74093, 74093, 170957, 360293, 679733, 2004917, 2004917, 69009533, 138473837, 237536213, 384479933, 883597853, 1728061733, 1728061733, 1728061733, 1728061733
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
All terms are congruent to 5 mod 24. - Jianing Song, Feb 17 2019
Also a(n) is the least prime r congruent to 5 mod 8 such that the first n odd primes are quadratic nonresidues modulo r. Note that r == 5 (mod 8) implies 2 is a quadratic nonresidue modulo r. See A001986 for the case where r == 3 (mod 8). - Jianing Song, Feb 19 2019
|
|
REFERENCES
|
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
PROG
|
(PARI) isok(p, oddpn) = {forprime(q=3, oddpn, if (kronecker(p, q) != -1, return (0)); ); return (1); }
a(n) = {my(oddpn = prime(n+1)); forprime(p=3, , if ((p%8) == 5, if (isok(p, oddpn), return (p)); ); ); } \\ Michel Marcus, Oct 17 2017
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|