|
Search: id:A128125
|
|
|
| A128125 |
|
Numbers n such that 2^n == 14 (mod n). |
|
+0
6
|
|
| 1, 2, 3, 10, 1010, 61610, 469730, 2037190, 3820821, 9227438, 21728810, 24372562
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Next term is bigger than 5*10^7. - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), May 05 2007
|
|
LINKS
|
Joe K. Crump, 2^n mod n
|
|
MATHEMATICA
|
For[n=1, n<= 10^6, n++, If[PowerMod[2, n, n] == Mod[14, n], Print[n]]] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), May 05 2007
|
|
CROSSREFS
|
Cf. A015910, A036236, A050259 = numbers n such that 2^n == 3 (mod n), A033981, A051447, A033982, A051446, A033983, A128121, A128122, A128123, A128124, A128126.
Sequence in context: A119810 A055708 A132536 this_sequence A070239 A002443 A111788
Adjacent sequences: A128122 A128123 A128124 this_sequence A128126 A128127 A128128
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 15 2007
|
|
EXTENSIONS
|
1, 2, 3 and 10 added by njas, Apr 23 2007.
More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), May 05 2007
|
|
|
Search completed in 0.002 seconds
|
