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.

A060357 a(n) = smallest prime > lcm(1..n).

Original entry on oeis.org

2, 2, 3, 7, 13, 61, 61, 421, 853, 2521, 2521, 27733, 27733, 360391, 360391, 360391, 720743, 12252259, 12252259, 232792561, 232792561, 232792561, 232792561, 5354228921, 5354228921, 26771144401, 26771144401, 80313433231, 80313433231, 2329089562843, 2329089562843
Offset: 0

Views

Author

N. J. A. Sloane, Apr 01 2001

Keywords

Crossrefs

Programs

  • Magma
    [NextPrime(Lcm([1..n])): n in [0..30]]; // Vincenzo Librandi, Mar 20 2018
  • Maple
    [seq(nextprime(A003418(n)), n=0..60)];
  • Mathematica
    Join[{2}, Table[NextPrime[LCM@@Range[n], 1], {n, 1, 30}]] (* Vincenzo Librandi, Mar 20 2018 *)
  • PARI
    a(n) = nextprime(lcm([1..n])+1); \\ Michel Marcus, Mar 18 2018
    

Formula

a(n) = A151800(A003418(n)). - Michel Marcus, Mar 20 2018