|
Search: id:A051447
|
|
|
| A051447 |
|
Numbers n such that 2^n (mod n) == 9. |
|
+0
7
|
|
| 2228071, 16888457, 352978207, 1737848873, 77362855777, 567442642711
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
Joe K. Crump, 2^n mod n
|
|
CROSSREFS
|
Cf. A125000 2^n (mod n) == 19, A124974 2^n (mod n) == 17, A033983 2^n (mod n) == 15, A033982 2^n (mod n) == 11, A033981 2^n (mod n) == 7, A050259 2^n == 3 (mod n), A124977 Least number m such that 2^m (mod m) == 2n+1, A124965 Odd values of 2^n (mod n) for n's in A015911, A015911 2^n (mod n) is odd, A015910 2^n (mod n).
Cf. A033981, A033982, A033983.
|
|
KEYWORD
|
hard,nonn,new
|
|
AUTHOR
|
Joe K. Crump (joecr(AT)carolina.rr.com)
|
|
EXTENSIONS
|
Edited by njas, Jun 22 2008, at the suggestion of Don Reble.
|
|
|
Search completed in 0.002 seconds
|
