OFFSET
1,2
COMMENTS
The Euler polynomial gives primes for consecutive x from 0 to 39.
For numbers x for which x^2 + x + 41 is not prime, see A007634.
For composite numbers of the form x^2 + x + 41, see A145292.
For the smallest x such that polynomial x^2 + x + 41 has exactly n distinct prime divisors, see A145293.
Sequence interpreted as a(n)^2 + a(n) + 41 having a prime divisor with multiplicity that is exactly n. - Bert Dobbelaere, Jan 22 2019
LINKS
Bert Dobbelaere, Table of n, a(n) for n = 1..100
Bert Dobbelaere, Python program
EXAMPLE
a(2)=40 because when x=40 then x^2 + x + 41 = 1681 = 41^2;
a(3)=1721 because when x=1721 then x^2 + x + 41 = 2963603 = 43*41^3;
a(4)=14144 because when x=14144 then x^2 + x + 41 = 200066921 = 41*47^4;
a(5)=2294005 because when x=2294005 then x^2 + x + 41 = 5262461234071 = 35797*43^5.
a(6)=326924482: a(6)^2 + a(6) + 41 = 106879617257892847 = 9915343 * 47^6. - Hugo Pfoertner, Mar 08 2018
CROSSREFS
KEYWORD
nonn
AUTHOR
Artur Jasinski, Oct 07 2008
EXTENSIONS
Title changed, a(1) and a(6) from Hugo Pfoertner, Mar 08 2018
More terms from Bert Dobbelaere, Jan 22 2019
STATUS
approved