Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001986
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A001986 Let p = n-th odd prime. Then a(n) = least prime congruent to 3 modulo 8 such that Legendre(-a(n), q) = -1 for all odd primes q <= p.
(Formerly M5073 N2195)
+0
6
19, 43, 43, 67, 67, 163, 163, 163, 163, 163, 163, 222643, 1333963, 1333963, 2404147, 2404147, 20950603, 51599563, 51599563, 96295483, 96295483, 146161723, 1408126003, 3341091163, 3341091163, 3341091163, 52947440683 (list; graph; listen)
OFFSET

1,1

COMMENT

Numbers so far are all 19 mod 24. - Ralf Stephan (ralf(AT)ark.in-berlin.de), Jul 07 2003

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.

CROSSREFS

Cf. A001987, A094841-A094845, etc.

Sequence in context: A140603 A139580 A094841 this_sequence A139811 A095101 A095086

Adjacent sequences: A001983 A001984 A001985 this_sequence A001987 A001988 A001989

KEYWORD

nonn

AUTHOR

njas

EXTENSIONS

Revised Jun 14 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research