A096633 Let p = n-th prime == 3 mod 8 (A007520); a(n) = smallest prime q such that p is not a square mod q.

3, 3, 7, 5, 3, 5, 3, 3, 3, 7, 5, 3, 11, 3, 3, 5, 5, 13, 3, 13, 3, 3, 3, 3, 13, 5, 5, 3, 11, 3, 7, 5, 3, 3, 7, 11, 5, 7, 3, 7, 5, 5, 3, 3, 3, 11, 3, 5, 3, 19, 3, 3, 3, 7, 3, 3, 3, 7, 5, 3, 3, 7, 3, 11, 3, 5, 3, 7, 5, 5, 3, 3, 5, 3, 3, 3, 5, 3, 17, 3, 5, 3, 7, 13, 5, 3, 11, 3, 3, 5, 7, 3, 3, 5, 3, 7, 3, 7, 5, 3

Offset: 1

Author

Robert G. Wilson v, Jun 24 2004

Keywords

• nonn

Programs

Mathematica

f[n_] := Block[{k = 2}, While[ JacobiSymbol[n, Prime[k]] == 1, k++ ]; Prime[k]]; f /@ Select[ Prime[ Range[435]], Mod[ #, 8] == 3 &]