|
Search: id:A001992
|
|
|
| A001992 |
|
Let p = n-th odd prime. Then a(n) = least prime congruent to 5 modulo 8 such that Legendre(a(n), q) = -1 for all odd primes q <= p.
(Formerly M4012 N1663)
|
|
+0
4
|
|
| 5, 53, 173, 173, 293, 2477, 9173, 9173, 61613, 74093, 74093, 74093, 170957, 360293, 679733, 2004917, 2004917, 69009533, 138473837, 237536213, 384479933, 883597853, 1728061733, 1728061733, 1728061733, 1728061733
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
M. J. Jacobson, Jr., Computational Techniques in Quadratic Fields, Master's thesis, University of Manitoba, Winnipeg, Manitoba, 1995.
Jacobson, Michael J., Jr. and Williams, Hugh C., New quadratic polynomials with high densities of prime values, Math. Comp. 72 (2003), no. 241, 499-519.
D. H. Lehmer, E. Lehmer and D. Shanks, Integer sequences having prescribed quadratic character, Math. Comp., 24 (1970), 433-451. [There is an error in the table given in this paper.]
|
|
CROSSREFS
|
Cf. A094842-A094846, A094848-A094851, etc., A001986, A001987.
Adjacent sequences: A001989 A001990 A001991 this_sequence A001993 A001994 A001995
Sequence in context: A075540 A006562 A094847 this_sequence A094849 A094852 A058867
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
Corrected and extended Jun 14 2004.
|
|
|
Search completed in 0.002 seconds
|
