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.

A077018 Closest prime to n (break ties by taking the larger prime).

Original entry on oeis.org

2, 2, 2, 3, 5, 5, 7, 7, 7, 11, 11, 11, 13, 13, 13, 17, 17, 17, 19, 19, 19, 23, 23, 23, 23, 23, 29, 29, 29, 29, 31, 31, 31, 31, 37, 37, 37, 37, 37, 41, 41, 41, 43, 43, 43, 47, 47, 47, 47, 47, 53, 53, 53, 53, 53, 53, 59, 59, 59, 59, 61, 61, 61, 61, 67, 67, 67, 67, 67, 71, 71, 71
Offset: 0

Views

Author

Eric W. Weisstein, Oct 17 2002

Keywords

Crossrefs

This is the same as A051697 except that one of the 3s is deleted here.

Programs

  • Mathematica
    a[n_] := (np = NextPrime[n]; pp = NextPrime[np, -1]; Which[np > 2n - pp, pp, np < 2n - pp, np, True, np]); a[0] = a[1] = 2; Table[a[n], {n, 0, 71}] (* Jean-François Alcover, Oct 31 2012 *)