|
|
A120395
|
|
Let p(1) = 13. Then a(n) is the least k such that p(n+1) = (k*p(n))^2 + k*p(n) - 1 is prime.
|
|
4
|
|
|
1, 1, 4, 4, 10, 1, 351, 240, 620, 1362, 2184, 46, 2944
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
p sequence starts 181, 32941, 17361883459, 4822959955971812408731, ...
|
|
LINKS
|
|
|
PROG
|
(PARI) p=13; for(i=1, 9, k=1; while(!ispseudoprime(t=(k*p)^2+k*p-1), k++); p=t; print1(k", ")) \\ Charles R Greathouse IV, Apr 20 2012
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|