The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A215049 Number of primes of the form 1 + b^8 for 1 < b < 10^n. 13

%I #25 Aug 13 2012 16:19:11

%S 2,2,40,335,2498,20886,174368,1507722,13300713

%N Number of primes of the form 1 + b^8 for 1 < b < 10^n.

%C Primes 1 + b^8 are a form of generalized Fermat primes. It is conjectured that a(n) is asymptotic to 0.261599*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>

%F a(n) = A214454(8*n) - 1.

%e a(1) = 2 because the only Fermat primes F_3(b) where b<10^1 are the primes: 257, 65537.

%t Table[Length[Select[Range[2,10^n-1]^8 + 1, PrimeQ]], {n, 5}] (* _T. D. Noe_, Aug 01 2012 *)

%o (PARI) a(n) = sum(b=1, 10^n/2-1, isprime((2*b)^8+1))

%Y Cf. A214454.

%K nonn

%O 1,1

%A _Henryk Dabrowski_, Aug 01 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 23 00:00 EDT 2024. Contains 372758 sequences. (Running on oeis4.)