|
| |
|
|
A051447
|
|
Integers n such that 2^n == 9 (mod n).
|
|
6
| | |
|
|
|
OFFSET
| 1,2
|
|
|
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.
Sequence in context: A008849 A076914 A076915 * A076910 A172771 A116257
Adjacent sequences: A051444 A051445 A051446 * A051448 A051449 A051450
|
|
|
KEYWORD
| hard,nonn,more
|
|
|
AUTHOR
| Joe K. Crump (joecr(AT)carolina.rr.com)
|
|
|
EXTENSIONS
| Edited by N. J. A. Sloane (njas(AT)research.att.com), Jun 22 2008, at the suggestion of Don Reble.
Terms 1, 7 prepended by Max Alekseyev (maxale(AT)gmail.com), May 18 2011
|
| |
|
|
