A338613 - OEIS

%I #57 Dec 01 2020 03:29:43

%S 2,3,11,71,701,9467,168599,3860009,111498091,4002608003,176359202639,

%T 9437436701437,607818993573569,46744099128452807,4262700354254812091,

%U 458091929703695291747,57691186909930154615407,8471601990692484416847631,1443868262009075144775972529

%N Numbers given by a(n) = 1 + floor(c^(n^1.5)) where c=2.2679962677... is the constant defined at A338837

%C Assuming Cramer's conjecture on largest prime gaps, it can be proved that there exists at least one constant 'c' such that all a(n) are primes for n as large as required. The constant giving the smallest growth rate is c=2.2679962677067242473285532807253717745270422544...

%C This exponential sequence of prime numbers grows very slowly compared to Mills' sequence for which each new term has 3 times more digits than the previous one. More than 60 terms (all prime numbers) can be easily calculated for the sequence described here which is quite remarkable for an exponential sequence.

%C Algorithm to compute the smallest constant 'c' and the associated prime number sequence a(n).

%C 0.   n=0, a(0)=2, c=2, d=1.5

%C 1.   n=n+1

%C 2.   b=1+floor(c^(n^d))

%C 3.   p=smpr(b)     smallest prime >= b

%C 4.   If p=b then a(n)=p, go to 1.

%C 5.   c=(p-1)^(1/n^d)

%C 6.   a(n)=p

%C 7.   k=1

%C 8.   b=1+floor(c^(k^d))

%C 9.   If b<>a(k) then p=smpr(b), n=k, go to 5.

%C 10. If k<n-1 then k=k+1, go to 8.

%C 11. go to 1.

%C I propose the following generalization:  find the function f(n) with f(0)=0 and f(x)>x for x>=2 such that there exists a suitable positive constant c(f) giving the increasing prime sequence a(n)=1+floor(c^f(n)) with the smallest possible growth rate. Since a(0)=2, c(f)>=2.

%H François Marques, <a href="/A338613/b338613.txt">Table of n, a(n) for n = 0..199</a>

%H Bernard Montaron, <a href="https://arxiv.org/abs/2011.14653">Exponential prime sequences</a>, arXiv:2011.14653 [math.NT], 2020.

%F a(n) = 1 + floor(c^(n^1.5)) where c=2.2679962677...

%o (PARI)

%o c(n=40, prec=100)={

%o   my(curprec=default(realprecision));

%o   default(realprecision, max(prec, curprec));

%o   my(a=List([2]), d=1.5, c=2.0, b, p, ok, smpr(b)=my(p=b); while(!isprime(p), p=nextprime(p+1)); return(p); );

%o   for(j=1, n-1,

%o     b=1+floor(c^(j^d));

%o     until(ok,

%o       ok=1;

%o       p=smpr(b);

%o       listput(a,p,j+1);

%o       if(p!=b,

%o          c=(p-1)^(j^(-d));

%o          for(k=1,j-2,

%o              b=1+floor(c^(k^d));

%o              if(b!=a[k+1],

%o                 ok=0;

%o                 j=k;

%o                 break;

%o                );

%o             );

%o         );

%o     );

%o   );

%o   default(realprecision, curprec);

%o   return(a);

%o } \\ _François Marques_, Nov 12 2020

%Y Cf. A338837, A338850, A051021, A051254.

%K nonn

%O 0,1

%A _Bernard Montaron_, Nov 03 2020