|
| |
|
|
A016047
|
|
Smallest prime factor of Mersenne numbers.
|
|
11
| |
|
|
3, 7, 31, 127, 23, 8191, 131071, 524287, 47, 233, 2147483647, 223, 13367, 431, 2351, 6361, 179951, 2305843009213693951, 193707721, 228479, 439, 2687, 167, 618970019642690137449562111, 11447, 7432339208719, 2550183799, 162259276829213363391578010288127, 745988807, 3391, 170141183460469231731687303715884105727, 263
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Contribution from Lekraj Beedassy (blekraj(AT)yahoo.com), Jun 11 2009: (Start)
"Mersenne numbers", here, implies A001348.
Compare with sequence A049479, where "Mersenne numbers" is used in the sense of A000225. (End)
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n=1..95 (derived from Brillhart et al.)
C. K. Caldwell, Mersenne Primes
|
|
|
MATHEMATICA
| a = {}; Do[If[PrimeQ[n], w = 2^n - 1; c = FactorInteger[w]; b = c[[1]][[1]]; AppendTo[a, b]], {n, 2, 100}]; a - Artur Jasinski (grafix(AT)csl.pl), Dec 11 2007
|
|
|
PROG
| (PARI) forprime(p=2, 150, print1(factor(2^p-1)[1, 1], ", "))
|
|
|
CROSSREFS
| Cf. A003260, A046800
Sequence in context: A061095 A103901 A089162 * A003260 A152058 A138865
Adjacent sequences: A016044 A016045 A016046 * A016048 A016049 A016050
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Robert G. Wilson v (rgwv(AT)rgwv.com)
|
| |
|
|
