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

%I #13 Sep 23 2023 03:39:02

%S 1,10,86,581,4148,31984,261080,2208196,19132652,168806740,1510676802

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

%F a(n) = A331876(n) - 1. - _Amiram Eldar_, Sep 23 2023

%e 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.

%t 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

%Y Cf. A005846, A056561, A331876.

%K nonn,more

%O 0,2

%A _Shyam Sunder Gupta_, Aug 11 2013

%E a(10) from _Amiram Eldar_, Sep 23 2023

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 April 25 07:53 EDT 2024. Contains 371964 sequences. (Running on oeis4.)