|
|
A001988
|
|
Let p be the n-th odd prime. a(n) is the least prime congruent to 7 modulo 8 such that Legendre(-a(n), q) = -Legendre(-1, q) for all odd primes q <= p.
(Formerly M4333 N1888)
|
|
2
|
|
|
7, 7, 127, 463, 463, 487, 1423, 33247, 73327, 118903, 118903, 118903, 454183, 773767, 773767, 773767, 773767, 86976583, 125325127, 132690343, 788667223, 788667223, 1280222287, 2430076903, 10703135983, 10703135983, 10703135983
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Numbers so far are all congruent to 7 (mod 24). - Ralf Stephan, Jul 07 2003
|
|
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) != -kronecker(-1, q), return (0)); ); return (1); }
a(n) = {oddpn = prime(n+1); forprime(p=3, , if ((p%8) == 7, if (isok(p, oddpn), return (p)); ); ); } \\ Michel Marcus, Oct 18 2017
(Python)
from sympy import legendre_symbol as L, primerange, prime, nextprime
def isok(p, oddpn):
for q in primerange(3, oddpn + 1):
if L(p, q)!=-L(-1, q): return 0
return 1
def a(n):
oddpn=prime(n + 1)
p=3
while True:
if p%8==7:
if isok(p, oddpn): return p
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|