|
Search: id:A001916
|
|
|
| A001916 |
|
Primes p such that the congruence 2^x = 5 (mod p) is solvable.
(Formerly M4772 N2038)
|
|
+0
2
|
|
| 2, 3, 11, 13, 19, 29, 37, 41, 53, 59, 61, 67, 71, 79, 83, 101, 107, 131, 139, 149, 163, 173, 179, 181, 191, 197, 199, 211, 227, 239, 251, 269, 271, 293, 311, 317, 347, 349, 359, 373, 379, 389, 401, 409, 419, 421, 443, 449, 461, 467, 479, 491, 509, 521, 523, 541, 547, 557
(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. 64.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1000
|
|
CROSSREFS
|
Cf. A001915.
Sequence in context: A045335 A020599 A038967 this_sequence A089151 A089152 A115669
Adjacent sequences: A001913 A001914 A001915 this_sequence A001917 A001918 A001919
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
Better description and more terms from David W. Wilson (davidwwilson(AT)comcast.net), Dec 12 2000. Description corrected by Joe K. Crump (joecr(AT)carolina.rr.com), Jan 17 2001.
|
|
|
Search completed in 0.002 seconds
|
