The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A331876 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A331876

Number of primes of the form P(k) = k^2 + k + 41 for k <= 10^n, where P(k) is Euler's prime-generating polynomial A202018.
(history; published version)

#16 by Joerg Arndt at Fri Jan 31 01:47:06 EST 2020

STATUS

reviewed

approved

#15 by Michel Marcus at Fri Jan 31 00:19:56 EST 2020

STATUS

proposed

reviewed

#14 by Hugo Pfoertner at Thu Jan 30 19:52:04 EST 2020

STATUS

editing

proposed

#13 by Hugo Pfoertner at Thu Jan 30 19:51:35 EST 2020

DATA

2, 11, 87, 582, 4149, 31985, 261081, 2208197, 19132653, 168806741, 1510676803

CROSSREFS

Cf. A005846, A007634, A202018, A319906, A331877.

STATUS

approved

editing

#12 by Susanna Cuyler at Thu Jan 30 08:42:32 EST 2020

STATUS

proposed

approved

#11 by Hugo Pfoertner at Thu Jan 30 06:42:25 EST 2020

STATUS

editing

proposed

#10 by Hugo Pfoertner at Thu Jan 30 06:39:57 EST 2020

DATA

2, 11, 87, 582, 4149, 31985, 261081, 2208197, 19132653, 168806741

#9 by Hugo Pfoertner at Thu Jan 30 06:38:32 EST 2020

CROSSREFS

Cf. A005846, A007634, A202018, A319906.

STATUS

proposed

editing

#8 by Hugo Pfoertner at Thu Jan 30 06:30:06 EST 2020

STATUS

editing

proposed

#7 by Hugo Pfoertner at Thu Jan 30 06:28:10 EST 2020

PROG

(PARI) n=0; m=1; for(k=0, 10^8, 7, my(j=k^2+k+41); if(isprime(j), n++); if(k==m, m=m*=10; print1(n, ", ")))