Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #10 Jun 22 2022 10:57:18
%S 1,2,16,3,9,11,136,219,51,1428
%N 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).
%e 1*29*(1*29-1)-1 = 811 (prime) so k(1) = 1, P(1) = 811.
%o (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
%Y Cf. A141233-A141240.
%K nonn
%O 1,2
%A _Pierre CAMI_, Jun 16 2008
%E a(10) from _Charles R Greathouse IV_, Dec 27 2011