This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A215970 #6 Sep 07 2012 04:28:58 %S A215970 0,0,0,0,1,14,28 %N A215970 Number of primes of the form 1 + b^65536 for 1 < b < 10^n. %C A215970 Primes 1 + b^65536 are a form of generalized Fermat primes. %C A215970 It is conjectured that a(n) is asymptotic to 0.000170833*li(10^n) %H A215970 Yves Gallot, <a href="http://yves.gallot.pagesperso-orange.fr/primes/results.html">Status of the smallest base values yielding Generalized Fermat primes</a> %H A215970 Yves Gallot, <a href="http://yves.gallot.pagesperso-orange.fr/primes/stat.html">How many prime numbers appear in a sequence ?</a> %H A215970 Yves Gallot, <a href="http://yves.gallot.pagesperso-orange.fr/papers/ccdgfpn.html">A Problem on the Conjecture Concerning the Distribution of Generalized Fermat Prime numbers (a new method for the search for large primes)</a> %H A215970 Mersenne Wiki, <a href="http://mersennewiki.org/index.php/User:Merfighters/listtest">Table of known GF primes b^n+1 where n (exponent) is at least 8192</a> %e A215970 a(5) = 1 because the generalized Fermat numbers F_16(b) where b<10^5 are prime only for b = 48594. %o A215970 (PARI) a(n) = sum(b=1, 10^n/2-1, isprime((2*b)^65536+1)) %Y A215970 Cf. A215047, A215048, A215049, A215050, A215051, A215057, A215058, A215698, A215699, A215700. %K A215970 nonn %O A215970 1,6 %A A215970 _Henryk Dabrowski_, Aug 29 2012