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.

Showing 1-1 of 1 results.

A060362 a(n) = Min { { smallest prime > k } - k, k - { largest prime < k } }, where k = lcm(1..n) = A003418(n).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 13, 13, 23, 23, 23, 17, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 43, 43, 43, 43, 47, 47, 59, 59, 59, 59, 1, 1, 59, 59, 59, 59, 61, 61, 61, 61, 61, 61, 113, 113, 1, 1, 1, 97, 97, 97, 73, 73, 73, 73, 73, 73, 97
Offset: 3

Views

Author

N. J. A. Sloane, Apr 01 2001

Keywords

Crossrefs

Programs

  • Maple
    [seq( min( nextprime(A003418(n))-A003418(n), A003418(n)-prevprime(A003418(n)) ), n=3..100)];
  • Mathematica
    Min[NextPrime[#]-#,#-NextPrime[#,-1]]&/@Table[LCM@@Range[n],{n,80}] (* Harvey P. Dale, Jan 01 2019 *)
  • PARI
    a(n) = my(lcn = lcm([1..n])); min(nextprime(lcn+1)-lcn, lcn-precprime(lcn-1)); \\ Michel Marcus, Mar 29 2018

Extensions

Definition corrected by Jon E. Schoenfield, Mar 18 2018
Showing 1-1 of 1 results.