|
Search: id:A003629
|
|
|
| A003629 |
|
Primes p == +- 3 (mod 8), or, primes p such that 2 is not a square mod p.
(Formerly M2472)
|
|
+0
9
|
|
| 3, 5, 11, 13, 19, 29, 37, 43, 53, 59, 61, 67, 83, 101, 107, 109, 131, 139, 149, 157, 163, 173, 179, 181, 197, 211, 227, 229, 251, 269, 277, 283, 293, 307, 317, 331, 347, 349, 373, 379, 389, 397, 419, 421, 443, 461, 467, 491, 499, 509, 523, 541, 547, 557, 563
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Complement of A038873 relative to A000040.
Also primes p such that p divides 2^(p-1)/2 + 1. - Cino Hilliard (hillcino368(AT)gmail.com), Sep 04 2004
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 870.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1000
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
|
|
MATHEMATICA
|
Select[ Prime@Range[2, 105], JacobiSymbol[2, # ] == -1 &] (from Robert G. Wilson v (rgwv(at)rgwv.com), Dec 15 2005)
|
|
CROSSREFS
|
Cf. A000040, A038873.
Sequence in context: A059350 A059644 A059646 this_sequence A001122 A152871 A156221
Adjacent sequences: A003626 A003627 A003628 this_sequence A003630 A003631 A003632
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Mira Bernstein
|
|
|
Search completed in 0.002 seconds
|
