I can go into a bit more detail when you are ready for it. Let me know.

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

]]>P(9) is very large. I think it is over 100000 digits. Networking many computers together has a good chance of getting it. I do not know if it will be found to be the largest prime, perhaps P(10)?

]]>Sorry to disappoint you, but...http://oeis.org/A069151. They are already called Smarandache-Wellin numbers.

]]>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.

]]>I cannot understand how are you getting these results. Please elaborate.

Thanks

]]>Generally the primes thin out. It is natural to expect in this case that there would be big jumps each time.

]]>To verify the primality of each number takes a long time even using the fastest algorithms.]]>