|
Search: id:A002224
|
|
|
| A002224 |
|
Smallest prime p of form p = 8k+1 such that first n primes (p_1=2, ..., p_n) are quadratic residues mod p.
(Formerly M5040 N2176)
|
|
+0
6
|
|
| 17, 73, 241, 1009, 2689, 8089, 33049, 53881, 87481, 483289, 515761, 1083289, 3818929, 3818929, 9257329, 22000801, 48473881, 48473881, 175244281, 427733329, 427733329, 898716289, 8114538721, 9176747449, 23616331489
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
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.
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.
|
|
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)
|
|
CROSSREFS
|
Cf. A002223, A002225, A002226.
Adjacent sequences: A002221 A002222 A002223 this_sequence A002225 A002226 A002227
Sequence in context: A141972 A142648 A002189 this_sequence A096637 A112013 A097223
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from Don Reble (djr(AT)nk.ca), Sep 19 2001
|
|
|
Search completed in 0.002 seconds
|
