login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A137404 An early Cramer gap formula solved an integer sequence: 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

REFERENCES

http://www.dartmouth.edu/~chance/chance_news/for_chance_news/Riemann/cramer.pdf

LINKS

Table of n, a(n) for n=1..100.

FORMULA

a(n)=Ceiling[10*(Prime[n+1]-Prime[n])/(2*Floor[Sqrt[Prime[n]*Log[Prime[n]]])

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]

CROSSREFS

Sequence in context: A053822 A262922 A276652 * A110643 A010721 A046795

Adjacent sequences:  A137401 A137402 A137403 * A137405 A137406 A137407

KEYWORD

nonn,uned

AUTHOR

Roger L. Bagula, Apr 14 2008

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 13 21:59 EDT 2019. Contains 327981 sequences. (Running on oeis4.)