|
|
A202018
|
|
a(n) = n^2 + n + 41.
|
|
24
|
|
|
41, 43, 47, 53, 61, 71, 83, 97, 113, 131, 151, 173, 197, 223, 251, 281, 313, 347, 383, 421, 461, 503, 547, 593, 641, 691, 743, 797, 853, 911, 971, 1033, 1097, 1163, 1231, 1301, 1373, 1447, 1523, 1601, 1681, 1763, 1847, 1933, 2021, 2111, 2203, 2297, 2393
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
Euler's famous prime-generating polynomial; a(0) through a(39) are all prime.
|
|
LINKS
|
|
|
FORMULA
|
a(a(n) + n) = a(n)*a(n+1). - Vladimir Shevelev, Jul 16 2012 (This identity holds for all sequences of the form n^2 + n + c, Joerg Arndt, Jul 17 2012).
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Colin Barker, Sep 28 2014
G.f.: (41*x^2 - 80*x + 41) / (1-x)^3. - Colin Barker, Sep 28 2014
|
|
MAPLE
|
|
|
MATHEMATICA
|
|
|
PROG
|
(Haskell)
a202018 = (+ 41) . a002378
(Scala) (0 to 49).map((n: Int) => n * n + n + 41) // Alonso del Arte, Nov 29 2018
(Sage) [n^2+n+41 for n in range(50)] # G. C. Greubel, Dec 04 2018
(GAP) List([0..50], n -> n^2 +n+41); # G. C. Greubel, Dec 04 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|