Super Cullen & Woodall primes
Super Cullen and Woodall defined as:
C(n)= n*2^(n*n)+1
W(n)= n*2^(n*n)1
Primes so far
1*2^11
1*2^1+1
2*2^41
5*2^25+1
9*2^81+1
I think there are finite number of these primes, but I still wanted to search further.
I have checked these up to 5 Million bits and plan to search further.
I am using srsieve to sieve these numbers. Is there a faster sieve software or can gcwsieve be made faster for these numbers?
