login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A207820 Let A = A025584. a(n) is the smallest A(m) such that the interval (A(m)*n, A(m+1)*n) contains no primes from A. 5

%I #21 Feb 13 2013 23:58:29

%S 2,2,2,1783,967,1663,3187,4813,13873,20347,1783,2617,27743,14533,

%T 54829,71143,66169,46687,44119,57787,79609,552883,21397,297079,

%U 1187107,89017,798697,285763,761377,2660587,812047,1463257,2795059,2816239,2676727,3069607,2500297

%N Let A = A025584. a(n) is the smallest A(m) such that the interval (A(m)*n, A(m+1)*n) contains no primes from A.

%C Conjecture. For n>=3, every a(n) is the lesser of a pair of cousin primes p and p+4, cf. A023200.

%C The limit of a(n) as n goes to infinity is infinity.

%t Table[aPrime[[NestWhile[#1+1&,1,!(nextAPrime[n aPrime[[#1]]]>n aPrime[[#1+1]])&]]],{n,2,20}]

%o (PARI) is_a025584(x) = isprime(x) && !isprime(x-2)

%o a025584_next(n) = {local(p); p=n+1; while(!is_a025584(p), p=p+1); p}

%o no_a025584(a,b) = {local(x,r); r=1; for(x=a+1, b-1, if(is_a025584(x), r=0)); r}

%o a207820(n) = {local(r,rp); rp=2; r=3; while(!no_a025584(n*rp, n*r), rp=r; r=a025584_next(r)); rp} \\ _Michael B. Porter_, Jan 20 2013

%Y Cf. A025584, A023200, A195325.

%K nonn

%O 1,1

%A _Vladimir Shevelev_ and _Peter J. C. Moses_, Jan 10 2013

%E a(21)-a(37) from _Michael B. Porter_, Jan 20 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 11:35 EDT 2024. Contains 371912 sequences. (Running on oeis4.)