OFFSET
1,1
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).
A. E. Western and J. C. P. Miller, Tables of Indices and Primitive Roots. Royal Society Mathematical Tables, Vol. 9, Cambridge Univ. Press, 1968, p. XV.
LINKS
Michael Hortmann, Table of n, a(n) for n = 1..41
D. H. Lehmer, A sieve problem on "pseudo-squares", Math. Tables Other Aids Comp., 8 (1954), 241-242.
D. H. Lehmer, E. Lehmer and D. Shanks, Integer sequences having prescribed quadratic character, Math. Comp., 24 (1970), 433-451.
D. H. Lehmer, E. Lehmer and D. Shanks, Integer sequences having prescribed quadratic character, Math. Comp., 24 (1970), 433-451 [Annotated scanned copy]
A. E. Western and J. C. P. Miller, Tables of Indices and Primitive Roots, Royal Society Mathematical Tables, Vol. 9, Cambridge Univ. Press, 1968 [Annotated scans of selected pages]
EXAMPLE
32^2 = 2 mod 73, 21^2 = 3 mod 73.
MATHEMATICA
f[n_] := Block[{k = 2}, While[JacobiSymbol[n, Prime[k]] == 1, k++ ]; Prime[k]] (* Robert G. Wilson v *)
np[] := While[p = NextPrime[p]; Mod[p, 8] != 1]; p = 2; A002224 = {}; pp = {2}; np[]; While[Length[A002224] < 25, If[Union[JacobiSymbol[#, p] &[pp]] === {1}, AppendTo[pp, NextPrime[Last[pp]]]; Print[p]; AppendTo[A002224, p], np[]]]; A002224 (* Jean-François Alcover, Sep 09 2011 *)
PROG
(PARI) a(n, startAt=17)=my(v=primes(n)); forprime(p=startAt, , if(p%8>1, next); for(i=1, n, if(kronecker(v[i], p)<1, next(2))); return(p)) \\ Charles R Greathouse IV, Jun 26 2017
CROSSREFS
KEYWORD
nonn,nice
AUTHOR
EXTENSIONS
More terms from Don Reble, Sep 19 2001
More terms from Mike Oakes, Nov 28 2022
STATUS
approved