|
|
A141239
|
|
Sequence of k such that starting with P(0) = 29 then k(n)*P(n-1)*(k(n)*P(n-1)-1)-1 is the least prime = P(n).
|
|
4
|
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
EXAMPLE
|
1*29*(1*29-1)-1 = 811 (prime) so k(1) = 1, P(1) = 811.
|
|
PROG
|
(PARI) P=29; for(i=1, 20, k=0; while(!ispseudoprime(t=k++*P*(k*P-1)-1), ); P=t; print1(k", ")) \\ Charles R Greathouse IV, Dec 27 2011
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|