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.

A033559 a(n) = (q - p)/2, where p is the largest prime < n and q is the smallest prime > n.

Original entry on oeis.org

1, 2, 1, 3, 2, 2, 2, 3, 1, 3, 2, 2, 2, 3, 1, 3, 2, 2, 2, 5, 3, 3, 3, 3, 3, 4, 1, 4, 3, 3, 3, 3, 3, 5, 2, 2, 2, 3, 1, 3, 2, 2, 2, 5, 3, 3, 3, 3, 3, 6, 3, 3, 3, 3, 3, 4, 1, 4, 3, 3, 3, 3, 3, 5, 2, 2, 2, 3, 1, 4, 3, 3, 3, 3, 3, 5, 2, 2, 2, 5, 3, 3, 3, 3, 3, 7, 4, 4, 4, 4, 4, 4, 4, 6, 2, 2, 2
Offset: 4

Views

Author

Keywords

Programs

  • Mathematica
    a[n_] := (NextPrime[n] - NextPrime[n, -1])/2; Table[a[n], {n, 4, 100}] (* Jean-François Alcover, Apr 16 2013 *)

Extensions

More terms from Ben Paul Thurston, Mar 30 2007