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.

A051697 Closest prime to n (break ties by taking the smaller prime).

Original entry on oeis.org

2, 2, 2, 3, 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
Offset: 0

Views

Author

Keywords

Examples

			Closest primes to 0,1,2,3,4 are 2,2,2,3,3.
		

Crossrefs

Programs

  • Mathematica
    a[n_] := (np = NextPrime[n]; pp = Prime[PrimePi[np] - 1]; Which[np > 2n-pp, pp, np < 2n-pp, np, True, pp]); a[0] = a[1] = 2; Table[a[n], {n, 0, 71}] (* Jean-François Alcover, Jul 28 2011 *)
  • PARI
    a(n)=if(n<3, return(2)); my(p=precprime(n),q=nextprime(n)); if(q-nCharles R Greathouse IV, Apr 28 2015

Extensions

More terms from James Sellers