|
| |
|
|
A033982
|
|
Integers n such that 2^n == 11 (mod n).
|
|
9
| | |
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| 894157816841269897394424491194255510200782699 belongs to this sequence. [From Max Alekseyev]
|
|
|
LINKS
| Joe K. Crump, 2^n mod n
|
|
|
CROSSREFS
| Cf. A125000, A124974, A033983, A033981, A050259, A124977, A124965, A015911, A015910.
Cf. A015910, A015911, A033981, A050259, A124965, A124974, A124977, A015910, A015911, A033983, A125000.
Sequence in context: A178505 A003544 A176586 * A154824 A137131 A117721
Adjacent sequences: A033979 A033980 A033981 * A033983 A033984 A033985
|
|
|
KEYWORD
| nonn,more
|
|
|
AUTHOR
| Joe K. Crump (joecr(AT)carolina.rr.com)
|
|
|
EXTENSIONS
| Edited by N. J. A. Sloane (njas(AT)research.att.com), Jul 03 2008 at the suggestion of R. J. Mathar
Terms 1, 3 prepended by Max Alekseyev (maxale(AT)gmail.com), May 18 2011
a(9), a(10) from Max Alekseyev (maxale(AT)gmail.com), Jul 30 2011
|
| |
|
|
