[dnnrjfzk] First differences of Euler's prime generating polynomial

p(n) = n^2 + n + 41 = 41+n(n+1)

Generate 40 primes by adding even numbers, no multiplication.

n	p(n)	difference
0	41
1	43	2
2	47	4
3	53	6
4	61	8
5	71	10
6	83	12
7	97	14
8	113	16
9	131	18
10	151	20
11	173	22
12	197	24
13	223	26
14	251	28
15	281	30
16	313	32
17	347	34
18	383	36
19	421	38
20	461	40
21	503	42
22	547	44
23	593	46
24	641	48
25	691	50
26	743	52
27	797	54
28	853	56
29	911	58
30	971	60
31	1033	62
32	1097	64
33	1163	66
34	1231	68
35	1301	70
36	1373	72
37	1447	74
38	1523	76
39	1601	78

and the next term is not prime, 1681 = 41*41.