The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A063095 Record prime gap among first n+1 primes. 5
1, 2, 2, 4, 4, 4, 4, 4, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 8, 8, 8, 8, 8, 8, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
REFERENCES
D. S. Mitrinovic et al., Handbook of Number Theory, Kluwer, 1996, Section VII.22, p. 249. (See G(x), which is an analog of pi(x).)
LINKS
EXAMPLE
A value of d in this sequence persists until a larger value arises. Note that values like 10, 12, 16 are never maximal. Distinct, increasing prime gaps are given in A005250.
MATHEMATICA
Table[Max[Table[Prime[w+1]-Prime[w], {w, 1, j}]], {j, 1, 500}] a(n)= Max{p[j+1]-p[j]; j=1, ..n}
PROG
(Python)
from sympy import nextprime
def A063095(n):
c, p = 0, 2
for i in range(n):
q = nextprime(p)
c, p = max(c, q-p), q
return c # Chai Wah Wu, Sep 11 2019
CROSSREFS
Sequence in context: A164717 A164715 A164632 * A156726 A082852 A083551
KEYWORD
nonn
AUTHOR
Labos Elemer, Aug 07 2001
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 May 12 19:25 EDT 2024. Contains 372494 sequences. (Running on oeis4.)