|
| |
|
|
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; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
REFERENCES
| http://www.dartmouth.edu/~chance/chance_news/for_chance_news/Riemann/cramer.pdf
|
|
|
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: A054513 A066200 A053822 * A110643 A010721 A046795
Adjacent sequences: A137401 A137402 A137403 * A137405 A137406 A137407
|
|
|
KEYWORD
| nonn,uned
|
|
|
AUTHOR
| Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Apr 14 2008
|
| |
|
|
