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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A137404 a(n) = ceiling(10*(prime(n+1)-prime(n))/(2*floor(sqrt(prime(n)*log(prime(n)))))). 0
 5, 10, 5, 7, 2, 4, 2, 3, 4, 2, 3, 2, 1, 2, 3, 3, 1, 2, 2, 1, 2, 2, 2, 3, 1, 1, 1, 1, 1, 4, 1, 2, 1, 2, 1, 2, 2, 1, 2, 2, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Table of n, a(n) for n=1..100. Andrew Granville, Harald Cramer and the Distribution of Prime Numbers MATHEMATICA a = Flatten[Table[10*x /. Solve[Prime[n + 1] -Prime[n] - x*2*Floor[Sqrt[Prime[n]*Log[Prime[n]]]] == 0, x], {n, 1, 100}]]; Ceiling[a] PROG (PARI) a(n) = ceil(10*(prime(n+1)-prime(n))/ (2*floor(sqrt(prime(n)*log(prime(n)))))); \\ Michel Marcus, Oct 15 2020 CROSSREFS Cf. A000040. Sequence in context: A053822 A262922 A276652 * A110643 A010721 A046795 Adjacent sequences: A137401 A137402 A137403 * A137405 A137406 A137407 KEYWORD nonn,less AUTHOR Roger L. Bagula, Apr 14 2008 EXTENSIONS Name edited by Michel Marcus, Oct 15 2020 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.

Last modified September 21 21:03 EDT 2023. Contains 365503 sequences. (Running on oeis4.)