|
Search: id:A033982
|
|
|
| A033982 |
|
Numbers n such that 2^n (mod n) == 11. |
|
+0
10
|
|
| 262279, 143823239, 382114303, 1223853491, 381541784791, 556985326431
(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, 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. A015910, A015911, A033981, A050259, A124965, A124974, A124977, A015910, A015911, A033983, A125000.
|
|
KEYWORD
|
nonn,new
|
|
AUTHOR
|
Joe K. Crump (joecr(AT)carolina.rr.com)
|
|
EXTENSIONS
|
Edited by njas, Jul 03 2008 at the suggestion of R. J. Mathar
|
|
|
Search completed in 0.002 seconds
|
