|
%I #15 Nov 22 2020 01:32:47
%S 2,3,7,43,47,283,659,1319,1699,9227,11887,55399,71359,159707,396719,
%T 558643,793439,794039,1117379,1117943,1143887,2235887,5554067,6707747,
%U 6863323,13734803,15667447,16663963,18214099,20123239,45196799,46954223,55937239,93908447
%N a(n+1) = smallest prime p > a(n) such that p-1 divides a(1)*a(2)*...*a(n); or if no such prime p exists, then a(n+1) = smallest prime > a(n).
%H Jinyuan Wang, <a href="/A282027/b282027.txt">Table of n, a(n) for n = 1..200</a>
%p A[1]:= 2: P:= 1:
%p for n from 2 to 30 do
%p P:= A[n-1]*P;
%p p0:= nextprime(A[n-1]);
%p p:= p0;
%p while p-1 <= P and P mod (p-1) <> 0 do
%p p:= nextprime(p)
%p od:
%p if p-1 > P then A[n]:= p0
%p else A[n]:= p
%p fi;
%p od:
%p seq(A[i],i=1..30); # _Robert Israel_, Mar 17 2017
%o (PARI) lista(nn) = {my(d, k, m, t, v=List([2])); for(n=2, nn, k=1; m=oo; while((d=prod(i=1, t=k, v[i]))<m && k++<n, until(v[t]*d>m || t==n-1, t++); forsubset([t, k], w, if(ispseudoprime(d=prod(i=1, k, v[w[i]])+1) && d>v[n-1], m=min(m, d)))); listput(v, if(m<oo, m, nextprime(v[n-1]+1)))); v; } \\ _Jinyuan Wang_, Nov 21 2020
%Y Inspired by A007459 and A057459.
%K nonn
%O 1,1
%A _N. J. A. Sloane_, Feb 13 2017
%E Corrected and extended by _Robert Israel_, Mar 17 2017
%E More terms from _Jinyuan Wang_, Nov 21 2020
|
