|
Search: id:A094847
|
|
|
| A094847 |
|
Let p = n-th odd prime. Then a(n) = least positive integer congruent to 5 modulo 8 such that Legendre(a(n), q) = -1 for all odd primes q <= p. |
|
+0
3
|
|
| 5, 53, 173, 173, 293, 437, 9173, 9173, 24653, 74093, 74093, 74093, 170957, 214037, 214037, 214037, 2004917, 44401013, 71148173, 154554077, 154554077, 163520117, 163520117, 163520117, 261153653, 261153653, 1728061733
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
D. H. Lehmer, E. Lehmer and D. Shanks, Integer sequences having prescribed quadratic character, Math. Comp., 24 (1970), 433-451.
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.
|
|
CROSSREFS
|
Cf. A094842-A094846, A094848-A094850, etc., A001992, A001986, A001987.
Sequence in context: A163580 A075540 A006562 this_sequence A001992 A139899 A094849
Adjacent sequences: A094844 A094845 A094846 this_sequence A094848 A094849 A094850
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Jun 14 2004
|
|
|
Search completed in 0.002 seconds
|
