OFFSET
1,1
COMMENTS
a(1)=2; for n > 0, a(n+1) is the first prime of the form k*(a(n) - 1)*a(n) + 1. It exists by Dirichlet's theorem on arithmetic progressions.
It is simple to reconstruct a(n) from A339174, which has the more compact representation.
PROG
(PARI) p=2; k=1; print1(p, ", "); while(1, runningP=k*(p-1)*p+1; if(ispseudoprime(runningP), k=1; p=runningP; print1(p, ", ") , k++))
CROSSREFS
KEYWORD
nonn
AUTHOR
Jeppe Stig Nielsen, Dec 27 2022
STATUS
approved