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.
%I A333373 #12 Apr 08 2020 18:43:03
%S A333373 1,2,6,30,330,10230,1299210,921139890,4956653748090,
%T A333373 261270175715571990,169405230502395438168090,
%U A333373 1649555141343581679123602303970,287748466487735183193170029972221262770,1052440045241486547790272887133572295775622539770
%N A333373 a(n) = n + 1 for n <= 1; thereafter a(n) = a(n-1) * prime(gpf(a(n-1))).
%C A333373 For n > 1, a(n) belongs to A083207 (see "product" formula below and my Jan 16 2020 comment in A083207). - _Ivan N. Ianakiev_, Mar 17 2020
%F A333373 a(n) = Product_{k=0..n} A007097(k).
%F A333373 A156061(a(n+1)) = a(n).
%F A333373 A052126(a(n+1)) = a(n).
%e A333373 a(7) = a(6) * prime(gpf(a(6))) = prime(1) * prime(2) * prime(3) * prime(5) * prime(11) * prime(31) * prime(127) = 2 * 3 * 5 * 11 * 31 * 127 * 709 = 921139890.
%t A333373 a[0] = 1; a[n_] := a[n] = a[n - 1] Prime[FactorInteger[a[n - 1]][[-1, 1]]]; Table[a[n], {n, 0, 13}]
%t A333373 Table[Times @@ NestList[Prime@# &, 1, n], {n, 0, 13}]
%Y A333373 Cf. A006450, A006530, A007097, A052126, A076146, A156061.
%K A333373 nonn
%O A333373 0,2
%A A333373 _Ilya Gutkovskiy_, Mar 17 2020