|
|
A213162
|
|
Smallest prime p such that (k+1)*p^2-k are prime for k=1..n.
|
|
0
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
PROG
|
(PARI) a(n) = {my(p = 2); until (ok, ok = 1; for (k = 1, n, if (! isprime((k+1)*p^2-k), ok = 0; break; ); ); if (!ok, p = nextprime(p+1); )); return (p); } \\ Michel Marcus, Apr 19 2013
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|