|
Search: id:A050259
|
|
|
| A050259 |
|
Numbers n such that 2^n == 3 (mod n). |
|
+0
16
|
|
| 1, 4700063497, 3468371109448915, 8365386194032363, 10991007971508067
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
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.
a(2) was first computed by the Lehmers.
|
|
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
|
Joe K. Crump, 2^n mod n
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
CROSSREFS
|
Cf. A036236, A015940.
Sequence in context: A034916 A124977 A128172 this_sequence A015384 A072018 A158726
Adjacent sequences: A050256 A050257 A050258 this_sequence A050260 A050261 A050262
|
|
KEYWORD
|
nonn,more,hard
|
|
AUTHOR
|
Eric Weisstein (eric(AT)weisstein.com)
|
|
EXTENSIONS
|
a(1)-a(5) certified by Max Alekseyev, Jan 27 2007, Apr 27 2009.
|
|
|
Search completed in 0.002 seconds
|
