The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A016047 Smallest prime factor of Mersenne numbers. 15
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 (list; graph; refs; listen; history; text; internal format)



From Lekraj Beedassy, Jun 11 2009: (Start)

"Mersenne numbers", here, implies A001348.

Compare with sequence A049479, where "Mersenne numbers" is used in the sense of A000225. (End)

Submitted new b-file withdrawing last three terms previously submitted.  I had, before submitting that b-file, checked that the smallest known factors of incompletely factored Mersenne numbers was less than the known trial factoring limits recorded by Will Edgington in his LowM.txt file which can be found on his Mersenne page, (see link above.)  I have now discovered that I inadvertently omitted the purported a(203) from that check. - Daran Gill, Apr 05 2013

The would-be a(203) corresponds to 2^1237-1 which is currently P70*C303. Trial factoring has only been done to 60 bits, and since its difficulty doubles whenever the bit length is incremented by one, it cannot exhaustively search the space smaller than the sole known 70-digit (231-bit) factor. Probabilistic ECM testing indicates only that it is extremely unlikely that there is any undiscovered factor with digit-size smaller than the high fifties. See GIMPS links. - Gord Palameta, Aug 16 2018


T. D. Noe and Daran Gill, Table of n, a(n) for n = 1..202 (first 95 terms from T. D. Noe)

C. K. Caldwell, Mersenne Primes

Will Edgington, Mersenne Page

GIMPS, PrimeNet Known Factors of Mersenne Numbers (discovered recently for p < 2000), Exponent status of 2^1237 - 1, ECM testing status of 2^1237 - 1

Brady Haran and Matt Parker, How they found the World's Biggest Prime Number - Numberphile, Numberphile video (2016).


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, Dec 11 2007 *)


(PARI) forprime(p=2, 150, print1(factor(2^p-1)[1, 1], ", "))


Cf. A000668 (a subsequence), A003260, A046800.

Sequence in context: A061095 A103901 A089162 * A003260 A152058 A138865

Adjacent sequences:  A016044 A016045 A016046 * A016048 A016049 A016050




Robert G. Wilson v



Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 13 11:56 EDT 2021. Contains 342936 sequences. (Running on oeis4.)