Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001916
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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)
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research