|
| |
|
|
A033203
|
|
Primes congruent to {1, 2, 3} mod 8; or primes of form x^2+2*y^2; or primes p such that x^2 = -2 has a solution mod p.
|
|
17
| |
|
|
2, 3, 11, 17, 19, 41, 43, 59, 67, 73, 83, 89, 97, 107, 113, 131, 137, 139, 163, 179, 193, 211, 227, 233, 241, 251, 257, 281, 283, 307, 313, 331, 337, 347, 353, 379, 401, 409, 419, 433, 443, 449, 457, 467, 491, 499, 521, 523
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Sequence naturally partitions into two sequences: *all* primes p with ord_p(-2) odd (A163183)[ = the primes dividing 2^j +1 for some odd j] and certain primes p with ord_p(-2) even (A163185). [From Chris Smyth (c.smyth(AT)ed.ac.uk), Jul 23 2009]
|
|
|
REFERENCES
| D. Cox, "Primes of Form x^2 + n y^2", Wiley, 1989.
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n=1..1000
|
|
|
MATHEMATICA
| QuadPrimes[1, 0, 2, 10000] (* see A106856 *)
|
|
|
PROG
| (Haskell)
a033203 n = a033203_list !! (n-1)
a033203_list = [p | p <- a000040_list, mod p 8 <= 3]
-- Reinhard Zumkeller, Jan 22 2012
|
|
|
CROSSREFS
| Cf. A033200.
Cf. A039706, A003628 (complement with respect to A000040).
Sequence in context: A091734 A038902 A019355 * A051100 A051088 A051092
Adjacent sequences: A033200 A033201 A033202 * A033204 A033205 A033206
|
|
|
KEYWORD
| nonn,nice,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
