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.

A228123 Number of primes generated from Euler's polynomial x^2 + x + 41 from x = 1 to 10^n.

Original entry on oeis.org

1, 10, 86, 581, 4148, 31984, 261080, 2208196, 19132652, 168806740, 1510676802
Offset: 0

Views

Author

Shyam Sunder Gupta, Aug 11 2013

Keywords

Examples

			a(4) = 4148 because the number of primes generated from Euler's polynomial x^2 + x + 41 from x = 1 to 10^4 are 4148.
		

Crossrefs

Programs

  • Mathematica
    a = 0; n = 1; t = {}; Do[If[PrimeQ[x^2 + x + 41], a = a + 1]; If[Mod[x, n] == 0, n = n*10; AppendTo[t, a]], {x, 1, 1000000000}]; t

Formula

a(n) = A331876(n) - 1. - Amiram Eldar, Sep 23 2023

Extensions

a(10) from Amiram Eldar, Sep 23 2023