login
A096637
Smallest prime p == 1 mod 8 (A007519) and p > prime(n+2) such that p is a quadratic residue mod the first n odd primes 3, 5, 7, 11, ..., prime(n+1), and p is a quadratic non-residue mod prime(n+2).
2
17, 73, 241, 1009, 2689, 8089, 33049, 53881, 87481, 483289, 515761, 1083289, 7921489, 3818929, 9257329, 22000801, 68204761, 48473881, 175244281, 1149374521, 427733329, 898716289
OFFSET
0,1
COMMENTS
Same as smallest prime p == 1 mod 8 with the property that the Legendre symbol (p|q) = 1 for the first n odd primes q = prime(k+1), k = 1, 2, ..., n, and (p|q) = -1 for q = prime(n+2).
MATHEMATICA
f[n_] := Block[{k = 2}, While[ JacobiSymbol[n, Prime[k]] == 1, k++ ]; Prime[k]]; t = Table[0, {50}]; Do[p = Prime[n]; If[Mod[p, 8] == 1, a = f[p]; If[ t[[ PrimePi[a]]] == 0, t[[ PrimePi[a]]] = p; Print[ PrimePi[a], " = ", p]]], {n, 10^9}]; t
CROSSREFS
KEYWORD
nonn
AUTHOR
Robert G. Wilson v, Jun 24 2004
EXTENSIONS
Better name from Jonathan Sondow, Mar 07 2013
STATUS
approved