|
| |
|
|
A050259
|
|
Numbers n such that 2^n == 3 (mod n).
|
|
17
|
| |
|
|
|
OFFSET
|
1,2
|
|
|
COMMENTS
|
No other terms below 1.1*10^16.
Terms were computed: a(2) by the Lehmers, a(3) by Max Alekseyev, a(4) and a(5) by Joe K. Crump, a(?) = 63130707451134435989380140059866138830623361447484274774099906755 by P.-L. Montgomery.
|
|
|
REFERENCES
|
Mauldin, R. Daniel; Ulam, S. M.; Mathematical problems and games. Adv. in Appl. Math. 8 (1987), 281-344. [From N. J. A. Sloane, Jul 30 2009]
|
|
|
LINKS
|
Table of n, a(n) for n=1..5.
Joe K. Crump, 2^n mod n [Broken link?]
Eric Weisstein's World of Mathematics, 2
OEIS Wiki, 2^n mod n
|
|
|
CROSSREFS
|
Cf. A036236, A015940, A015910.
Sequence in context: A199631 A124977 A128172 * A219271 A175568 A224472
Adjacent sequences: A050256 A050257 A050258 * A050260 A050261 A050262
|
|
|
KEYWORD
|
nonn,more,hard
|
|
|
AUTHOR
|
Eric W. Weisstein
|
|
|
EXTENSIONS
|
a(1)-a(5) certified by Max Alekseyev, Jan 27 2007, Apr 27 2009.
|
|
|
STATUS
|
approved
|
| |
|
|
