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.

A214956 Number of primes of the form x^32 + 1 less than 10^n.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 6, 6, 7, 7, 7, 8, 8, 8, 8, 8
Offset: 1

Views

Author

Henryk Dabrowski, Jul 30 2012

Keywords

Comments

It is conjectured that there are infinitely many primes of the form x^32 + 1 (and thus this sequence never becomes constant), but this has not been proved.

Examples

			a(55) = 2 because the only primes of the form x^32 + 1 < 10^55 are the primes: 2, 185302018885184100000000000000000000000000000001.
		

Crossrefs

Cf. A006315 (k such that k^32+1 is prime).

Programs

  • PARI
    a(n) = sum(k=1, (10^n-1)^(1/32), isprime(k^32+1))