%I #9 May 06 2019 06:15:35

%S 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,

%T 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,

%U 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

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

%t 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 *)

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

%Y Cf. A094928, A096633, A096634, A096635.

%K nonn

%O 3,1

%A _N. J. A. Sloane_, Jun 19 2004