I noticed this and wondered if anyone has ever went on this path to find a large prime to put in the database. I haven't bought my rig yet to start working on the project for mersennes, but will soon and was just curious about this one as it seems fun to try maybe. Probably not enough cpu power for the is_prime tests, heh.
Quote:
In [2511]: for x in mersenne[0:21]:
...: z = 3 * 2**x1
...: g = gmpy2.next_prime(z)
...: print(x, gz)
...:
3 6
5 2
7 6
13 18
17 26
19 6
31 24
61 48
89 44
107 170
127 18
521 546
607 510
1279 18
2203 1964
2281 2748
3217 546
4253 1356
4423 2720

I just did the math and see why such a search path wouldn't be very fruitful, nevermind :)