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!)
A144256 a(n) = smallest prime in the range [n^K, (n+1)^K], where K = log(127)/log(16) = 1.74717117169304146332... 4

%I #27 Feb 20 2017 00:29:30

%S 2,5,7,13,17,23,31,41,47,59,67,79,89,101,127,127,149,157,173,191,211,

%T 223,241,263,277,307,317,347,359,383,409,431,457,479,499,541,557,577,

%U 607,631,659,691,719,751,787,809,839,877,907,937,967,997,1031,1069

%N a(n) = smallest prime in the range [n^K, (n+1)^K], where K = log(127)/log(16) = 1.74717117169304146332...

%C T. D. Noe submitted to primepuzzles.net the following conjecture #60, which is stronger than the Legendre's conjecture: For n>0 and k>=K, there is always a prime between n^k and (n+1)^k, where K = log(127)/log(16) = 1.74717117169304146332...

%C One could see that calculated terms for n=15 and n=16 yield the same value: 127, which make this conjecture (as originally defined) to be questionable. If this conjecture is modified to k>K, then there will be a distinct prime between 15^k and 16^k. It appears that the relatively large prime gap between 113 and 127 is the largest gap to overcome. Another way to correct/clarify the conjecture is to mention that both boundaries of the interval are included and that the same prime value may appear in two neighboring intervals. Of course the last version of the modified definition makes this conjecture to be different from the original Legendere conjecture (rather than to be an improvement of the original Legendere conjecture). [_Alexander R. Povolotsky_, Sep 26 2008]

%C The constant log(127)/log(16) is A194361. - _John W. Nicholson_, Dec 13 2013

%H G. C. Greubel, <a href="/A144256/b144256.txt">Table of n, a(n) for n = 1..5000</a>

%H Carlos Rivera, <a href="http://www.primepuzzles.net/conjectures/conj_060.htm">Conjecture 60: Generalization of Legendre's Conjecture</a>

%t k = Log[127]/Log[16]; Table[Select[Range[Ceiling[n^k], Floor[(n + 1)^k]], PrimeQ, 1][[1]], {n, 100}] (* _T. D. Noe_, Jan 30 2012 *)

%o (PARI) i=[];for(n=1, 500, for(j=ceil(n^(log(127)/log(16))), ceil((n+1)^(log(127)/log(16))), if(isprime(j), i=concat(i,j)); if(isprime(j), break)));i

%Y Cf. A000040, A144831, A143935.

%K nonn

%O 1,1

%A _Alexander R. Povolotsky_, Sep 16 2008

%E Extended by _T. D. Noe_, Jan 30 2012

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 25 08:27 EDT 2024. Contains 371964 sequences. (Running on oeis4.)