login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A228123 Number of primes generated from Euler's polynomial x^2 + x + 41 from x = 1 to 10^n. 2
1, 10, 86, 581, 4148, 31984, 261080, 2208196, 19132652, 168806740, 1510676802 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = A331876(n) - 1. - Amiram Eldar, Sep 23 2023
EXAMPLE
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.
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
CROSSREFS
Sequence in context: A145146 A252981 A184122 * A163412 A287827 A321853
KEYWORD
nonn,more
AUTHOR
Shyam Sunder Gupta, Aug 11 2013
EXTENSIONS
a(10) from Amiram Eldar, Sep 23 2023
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 8 19:26 EDT 2024. Contains 372341 sequences. (Running on oeis4.)