Hi cool_jessica;

There are not many results here. The problem requires a ton of computational firepower.

The numbers are formed by concantenating primes together. Then a couple of probabilistic prime testers are brought to bear. Since my last one was about 5000 digits long it takes a while to test it for primality. The next number in his series is too large for modern day machines. P(9) is unknown.

It is ok then! This is how mathematics flows! We think about something and other people think too! I have developed many mathematics formulations since I was 12 years old, the first was binomial expansion but of course someone had found it. Then I developed unidigit or digital root in characterizing equation in quest for the Fermat's Last theorem proof and I found out after sometimes that the hindus had using this digital roots for thousands years before. I had formulated sums of power for integers more than 10 years ago without even knowing that 300 years ago someone had found it but I never give up. Few new formulations that I think people had not finding it yet like sums of power for arithmetic progression, alternating sums of power for arithmetic progression, symmetric prime numbers.  Symmetric prime is my conjecture and it explains how Mersenne's Prime, Wagstaff's Prime, Fermat's Prime etc could be derived. Maybe people had found it but so far 300 years back none of literatures on sums of power for arithmetic progression did exist otherwise it could be used in the Fermat's Last Theorem long time ago. In few months time I would collaborate with one of the universities back here to find this prime using grid computing. This Primes could be bigger than Mersenne's primes anytime because of the bigger inputs. Hope none had found this type of Primes yet, otherwise I had to look for a way of finding something new:)

Hello Everybody,

Thanks for helping me out, but I think I will have research a bit more to know about all these calculations.