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!)
A195100 Numbers n such that there are no primes between (n-1)*sqrt(n-1) and n*sqrt(n). 0
1, 11, 21, 25, 28, 33, 66, 122, 140, 142, 188, 307, 322, 349, 1007, 1052 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Cramér's conjecture implies that the sequence is finite. - Robert Israel, Aug 11 2014
No more terms up to 2*10^10. - Jinyuan Wang, Mar 22 2019
LINKS
FORMULA
a(n+1) = A144140(n) + 1. - Jinyuan Wang, Mar 22 2019
EXAMPLE
a(1) = 1 because there are no numbers between (1-1)*sqrt(1-1) = 0 and 1*sqrt(1) = 1.
a(2) = 11 because (11-1)*sqrt(11-1) < (nonprimes 32,33,34,35,36) < 11*sqrt(11).
MAPLE
Primes:= select(isprime, {2, seq(2*i+1, i=1..10^6)}):
C:= map(p -> ceil(p^(2/3)), Primes);
{$1..max(C)} minus C; # Robert Israel, Aug 10 2014
MATHEMATICA
Select[Range[5000], (PrimePi[# Sqrt[#]] - PrimePi[(# - 1)Sqrt[# - 1]]) == 0 &] (* Alonso del Arte, Sep 09 2011 *)
Join[{1}, Flatten[Position[Partition[Table[PrimePi[n Sqrt[n]], {n, 1100}], 2, 1], _?(#[[2]]-#[[1]]==0&), 1, Heads->False]]+1] (* Harvey P. Dale, May 11 2018 *)
PROG
(PARI) for(n=1, 2*10^6, if(#primes([(n-1)*sqrt(n-1), n*sqrt(n)])==0, print1(n, ", "))) \\ Derek Orr, Aug 10 2014
(PARI) isok(n) = {k=floor((n-1)*sqrt(n-1))+1; while(!isprime(k), k++); k>n*sqrt(n); } \\ Jinyuan Wang, Mar 22 2019
CROSSREFS
Sequence in context: A350766 A189226 A261409 * A125164 A101223 A109686
KEYWORD
nonn,more
AUTHOR
STATUS
approved

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 16 00:00 EDT 2024. Contains 371696 sequences. (Running on oeis4.)