cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A096500 Let f(n) = smallest prime > n; a(n) = f(n+1) - f(n).

Original entry on oeis.org

1, 2, 0, 2, 0, 4, 0, 0, 0, 2, 0, 4, 0, 0, 0, 2, 0, 4, 0, 0, 0, 6, 0, 0, 0, 0, 0, 2, 0, 6, 0, 0, 0, 0, 0, 4, 0, 0, 0, 2, 0, 4, 0, 0, 0, 6, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 2, 0, 6, 0, 0, 0, 0, 0, 4, 0, 0, 0, 2, 0, 6, 0, 0, 0, 0, 0, 4, 0, 0, 0, 6, 0, 0, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 2, 0, 4, 0, 0, 0
Offset: 1

Views

Author

Labos Elemer, Jul 09 2004

Keywords

Crossrefs

First differences of A151800.
Cf. also A109578.

Programs

Formula

From Antti Karttunen, Jan 03 2019: (Start)
a(n) = A151800(n+1) - A151800(n).
a(n) = A010051(1+n) * A001223(A000720(1+n)).
(End)