|
| |
|
|
A122094
|
|
Prime divisors of Mersenne numbers. Primes p such that the multiplicative order of 2 modulo p is prime.
|
|
2
| |
|
|
3, 7, 23, 31, 47, 89, 127, 167, 223, 233, 263, 359, 383, 431, 439, 479, 503, 719, 839, 863, 887, 983, 1103, 1319, 1367, 1399, 1433, 1439, 1487, 1823, 1913, 2039, 2063, 2089, 2207, 2351, 2383, 2447, 2687, 2767, 2879, 2903, 2999, 3023, 3119, 3167, 3343
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n=1..1000
|
|
|
FORMULA
| p is a prime divisor of a Mersenne number 2^q - 1 iff prime q is the multiplicative order of 2 modulo p.
|
|
|
PROG
| (PARI) forprime(p=3, 10^5, if(isprime(znorder(Mod(2, p))), print1(p, ", ")))
|
|
|
CROSSREFS
| Cf. A001348, A016047, A003260, A000668.
Sequence in context: A127781 A165580 A187222 * A135570 A053027 A133432
Adjacent sequences: A122091 A122092 A122093 * A122095 A122096 A122097
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Max Alekseyev (maxale(AT)gmail.com), Oct 25 2006
|
| |
|
|
