A094929 Let p = n-th prime; a(n) = smallest odd prime q such that p is not a square mod q.

3, 5, 3, 5, 3, 7, 3, 3, 7, 5, 3, 5, 3, 3, 3, 7, 5, 3, 5, 11, 3, 3, 5, 3, 5, 3, 11, 3, 5, 3, 3, 7, 3, 11, 5, 5, 3, 3, 3, 7, 3, 5, 3, 7, 11, 5, 3, 7, 3, 3, 7, 3, 3, 3, 3, 7, 5, 3, 5, 3, 5, 3, 5, 3, 13, 5, 3, 7, 3, 3, 5, 5, 13, 3, 3, 5, 3, 7, 3, 13, 3, 5, 7, 3, 3, 5, 3, 5, 3, 3, 5, 3, 13, 3, 3, 3, 5, 11, 5

Offset

3,1

Links

Table of n, a(n) for n=3..101.

Mathematica

f[n_] := Block[{k = 2}, While[ JacobiSymbol[n, Prime[k]] == 1, k++ ]; Prime[k]]; f /@ Prime[Range[3, 100]] (* Robert G. Wilson v, Jun 24 2004 *)

Prog

(PARI) a(n) = {my(p=prime(n), q=3); while (!issquare(Mod(p, q)), q = nextprime(q+1)); q; } \\ Michel Marcus, May 06 2019

Crossrefs

Cf. A094928, A096633, A096634, A096635.

Sequence in context: A107489 A152050 A103506 * A096634 A105439 A142972

Adjacent sequences: A094926 A094927 A094928 * A094930 A094931 A094932

Keyword

nonn

Author

N. J. A. Sloane, Jun 19 2004

Status

approved