|
Search: id:A128121
|
|
|
| A128121 |
|
Numbers n such that 2^n == 5 (mod n). |
|
+0
6
|
|
| 1, 3, 19147, 129505699483, 674344345281, 1643434407157, 5675297754009, 12174063716147, 162466075477787, 324082741109271
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Note that "numbers n such that 2^n mod n = 5" defines a subset.
|
|
LINKS
|
Joe K. Crump, 2^n mod n
|
|
CROSSREFS
|
Cf. A015910, A036236, A050259 = numbers n such that 2^n == 3 (mod n), A033981, A051447, A033982, A051446, A033983, A128122, A128123, A128124, A128125, A128126.
Adjacent sequences: A128118 A128119 A128120 this_sequence A128122 A128123 A128124
Sequence in context: A047777 A124393 A116182 this_sequence A112406 A115475 A007350
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 15 2007
|
|
EXTENSIONS
|
1 and 3 added by njas, Apr 23 2007.
|
|
|
Search completed in 0.002 seconds
|
