View Single Post
 2015-05-21, 06:13 #9 Batalov     "Serge" Mar 2008 Phi(4,2^7658614+1)/2 47×197 Posts It is actually not empty -- and if you log in (at top right), then you can see any draft of any sequence (inc. this). Handy! Even if you are not entering sequences you can create a Wiki account.But in any case the sequence is this ATM: Code: 1, 1, 1, 1, 2, 10, 12, 10, 21, 25, 70, 670, 239, 2115, 586, 1619, 26800, 2505, 99019, 40903, 285641, 67166, 1852765 At UTM, rank #117 slot in fact was empty in the middle of the day (use: http://primes.utm.edu/primes/page.php and request rank = 117), but then at some point it collapsed back; maybe something broke in Chris' scripts. I am sure that it will be there sooner or later. In my hands, pfgw N-1 proof took only 11 hours. Chris uses -tc for some reason in his automatic server routines. P.S. What may be the case is that C.C. is running all ladder proofs, first. (And that is the right way to do it. I ran them all, too.) He is rigorous, and even if he wasn't, David Broadhurst is even more rigorous. Last fiddled with by Batalov on 2015-05-21 at 06:26 Reason: tpyos