|
Search: id:A001132
|
|
|
| A001132 |
|
Primes = +-1 mod 8.
(Formerly M4354 N1824)
|
|
+0
13
|
|
| 7, 17, 23, 31, 41, 47, 71, 73, 79, 89, 97, 103, 113, 127, 137, 151, 167, 191, 193, 199, 223, 233, 239, 241, 257, 263, 271, 281, 311, 313, 337, 353, 359, 367, 383, 401, 409, 431, 433, 439, 449, 457, 463, 479, 487, 503, 521, 569, 577, 593, 599
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Primes p such that 2 is a quadratic residue mod p.
Also primes p such that p divides 2^(p-1)/2 - 1. - Cino Hilliard (hillcino368(AT)gmail.com), Sep 04 2004
|
|
REFERENCES
|
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, December 1972 [alternative scanned copy].
Index entries for related sequences
C. Banderier, Calcul de (2/p)
|
|
CROSSREFS
|
For primes p such that x^m = 2 (mod p) has a solution see A001132 (for m=2), A040028 (m=3), A040098 (m=4), A040159 (m=5), A040992 (m=6), A042966 (m=7), A045315 (m=8), A049596 (m=9), A049542 (m=10) - A049595 (m=63). Jeff Lagarias (lagarias(AT)umich.edu) points out that all these sequences are different, although this may not be apparent from looking just at the initial terms.
Agrees with A038873 except for initial term.
Sequence in context: A107643 A058529 A120681 this_sequence A048976 A088546 A115591
Adjacent sequences: A001129 A001130 A001131 this_sequence A001133 A001134 A001135
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
