cp's OEIS Frontend

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.

A215961 Number of primes of the form 1 + b^8192 for 1 < b < 10^n.

Original entry on oeis.org

0, 0, 0, 0, 3, 74, 621
Offset: 1

Views

Author

Henryk Dabrowski, Aug 29 2012

Keywords

Comments

Primes 1 + b^8192 are a form of generalized Fermat primes. It is conjectured that a(n) is asymptotic to 0.00103368*li(10^n).

Examples

			a(5) = 3 because the generalized Fermat numbers F_13(b) where b<10^5 are prime only for b = 30406, 71852, 85654.
		

Crossrefs

Programs

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