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.

A060358 a(n) = largest prime < lcm(1..n).

Original entry on oeis.org

5, 11, 59, 59, 419, 839, 2503, 2503, 27701, 27701, 360337, 360337, 360337, 720703, 12252197, 12252197, 232792559, 232792559, 232792559, 232792559, 5354228879, 5354228879, 26771144371, 26771144371, 80313433159, 80313433159, 2329089562799, 2329089562799
Offset: 3

Views

Author

N. J. A. Sloane, Apr 01 2001

Keywords

Crossrefs

Programs

  • Maple
    b:= proc(n) option remember; `if`(n=0, 1, ilcm(n, b(n-1))) end:
    a:= n-> prevprime(b(n)):
    seq(a(n), n=3..30);  # Alois P. Heinz, Feb 17 2024
  • Mathematica
    Table[NextPrime[LCM@@Range[n],-1],{n,3,30}] (* Harvey P. Dale, May 28 2014 *)
  • PARI
    a(n) = precprime(lcm([1..n])); \\ Michel Marcus, Mar 18 2018
    
  • Python
    from sympy import prevprime, lcm
    def A060358(n):
        return prevprime(lcm(range(1,n+1))) # Chai Wah Wu, Jan 22 2020