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.

A247451 Largest primorial factor of n-th least product of primorial numbers, cf. A025487.

Original entry on oeis.org

1, 2, 2, 6, 2, 6, 2, 6, 30, 2, 6, 6, 30, 2, 6, 6, 30, 2, 6, 30, 6, 210, 6, 30, 2, 6, 30, 6, 210, 6, 30, 2, 6, 30, 6, 210, 6, 30, 30, 2, 30, 6, 210, 6, 30, 6, 210, 6, 30, 30, 2, 30, 6, 2310, 210, 6, 30, 6, 210, 6, 30, 30, 2, 30, 6, 2310, 210, 6, 30, 30, 6
Offset: 1

Views

Author

Reinhard Zumkeller, Sep 17 2014

Keywords

Crossrefs

Programs

  • Haskell
    a247451 n = a247451_list !! (n-1)
    a247451_list = map a007947 a025487_list
  • Mathematica
    (* First, load program f at A025487 *)
    Map[Product[Prime[i], {i, PrimeNu[#]}] &, Union@ Flatten@ f[6]] (* Michael De Vlieger, Jun 24 2024 *)

Formula

a(n) = A007947(A025487(n)) = A002110(A061394(n)).