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.

A215698 Number of primes of the form 1 + b^256 for 1 < b < 10^n.

Original entry on oeis.org

0, 0, 4, 30, 272, 2322
Offset: 1

Views

Author

Henryk Dabrowski, Aug 21 2012

Keywords

Comments

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

Examples

			a(3) = 4 because the generalized Fermat numbers F_8(b) where b<10^3 are prime only for b: 278, 614, 892, 898.
		

Crossrefs

Programs

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