|
Search: id:A001915
|
|
|
| A001915 |
|
Primes p such that the congruence 2^x = 3 (mod p) is solvable.
(Formerly M3807 N1555)
|
|
+0
2
|
|
| 2, 5, 11, 13, 19, 23, 29, 37, 47, 53, 59, 61, 67, 71, 83, 97, 101, 107, 131, 139, 149, 163, 167, 173, 179, 181, 191, 193, 197, 211, 227, 239, 263, 269, 293, 307, 311, 313, 317, 347, 349, 359, 373, 379, 383, 389, 409, 419, 421, 431, 443, 461, 467, 479, 491, 499, 503, 509, 523
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
M. Kraitchik, Recherches sur la Th\'{e}orie des Nombres. Gauthiers-Villars, Paris, Vol. 1, 1924, Vol. 2, 1929, see Vol. 1, p. 63.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1000
|
|
CROSSREFS
|
Cf. A001916.
Adjacent sequences: A001912 A001913 A001914 this_sequence A001916 A001917 A001918
Sequence in context: A139019 A031869 A045360 this_sequence A084792 A109640 A105961
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
Better description from Joe K. Crump (joecr(AT)carolina.rr.com), Dec 11, 2000.
More terms from David W. Wilson (davidwwilson(AT)comcast.net), Dec 12 2000
|
|
|
Search completed in 0.002 seconds
|
