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.

Showing 1-1 of 1 results.

A215051 Number of primes of the form 1 + b^32 for 1 < b < 10^n.

Original entry on oeis.org

0, 3, 22, 146, 1062, 8963, 74951, 651537, 5740807, 51389252
Offset: 1

Views

Author

Henryk Dabrowski, Aug 01 2012

Keywords

Comments

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

Examples

			a(2) = 3 because the Fermat numbers F_5(b) where b<10^2 are prime only for b = 30, 54, 96.
		

Crossrefs

Programs

  • Mathematica
    Table[Length[Select[Range[2,10^n-1]^32 + 1, PrimeQ]], {n, 4}] (* T. D. Noe, Aug 01 2012 *)
  • PARI
    a(n) = sum(b=1, 10^n/2-1, isprime((2*b)^32+1))

Formula

a(n) = A214956(32*n) - 1.

Extensions

a(9)-a(10) from Chai Wah Wu, Oct 18 2018
Showing 1-1 of 1 results.