|
%I #6 Sep 04 2012 17:15:20
%S 0,0,0,0,1,33,137
%N Number of primes of the form 1 + b^16384 for 1 < b < 10^n.
%C Primes 1 + b^16384 are a form of generalized Fermat primes.
%C It is conjectured that a(n) is asymptotic to 0.000488872*li(10^n)
%H 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 Yves Gallot, <a href="http://yves.gallot.pagesperso-orange.fr/primes/stat.html">How many prime numbers appear in a sequence ?</a>
%H 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 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 a(5) = 1 because the generalized Fermat numbers F_14(b) where b<10^5 are prime only for b = 67234.
%o (PARI) a(n) = sum(b=1, 10^n/2-1, isprime((2*b)^16384+1))
%Y Cf. A215047, A215048, A215049, A215050, A215051, A215057, A215058, A215698, A215699, A215700.
%K nonn
%O 1,6
%A _Henryk Dabrowski_, Aug 29 2012
| 