login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A247451
Largest primorial factor of n-th least product of primorial numbers, cf. A025487.
4
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,2
LINKS
FORMULA
a(n) = A007947(A025487(n)) = A002110(A061394(n)).
MATHEMATICA
(* First, load program f at A025487 *)
Map[Product[Prime[i], {i, PrimeNu[#]}] &, Union@ Flatten@ f[6]] (* Michael De Vlieger, Jun 24 2024 *)
PROG
(Haskell)
a247451 n = a247451_list !! (n-1)
a247451_list = map a007947 a025487_list
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Sep 17 2014
STATUS
approved