login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A215057 Number of primes of the form 1 + b^64 for 1 < b < 10^n. 11
0, 0, 8, 92, 606, 4835, 41059, 354239, 3133668 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

Primes 1 + b^64 are a form of generalized Fermat primes.

It is conjectured that a(n) is asymptotic to 0.0616053*li(10^n)

LINKS

Table of n, a(n) for n=1..9.

Yves Gallot, Status of the smallest base values yielding Generalized Fermat primes

Yves Gallot, How many prime numbers appear in a sequence ?

Yves Gallot, A Problem on the Conjecture Concerning the Distribution of Generalized Fermat Prime numbers (a new method for the search for large primes)

EXAMPLE

a(3) = 8 because the Fermat numbers F_6(b) where b<10^3 are prime only for b = 102, 162, 274, 300, 412, 562, 592, 728.

PROG

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

CROSSREFS

Cf. A215047, A215048, A215049, A215050, A215051, A215058.

Sequence in context: A187157 A332597 A331448 * A222400 A280159 A155615

Adjacent sequences:  A215054 A215055 A215056 * A215058 A215059 A215060

KEYWORD

nonn,more

AUTHOR

Henryk Dabrowski, Aug 01 2012

EXTENSIONS

a(8)-a(9) from  Kellen Shenton, Aug 09 2020

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 14 08:31 EDT 2021. Contains 345018 sequences. (Running on oeis4.)