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 A166475 #17 Jul 07 2023 21:06:50
%S A166475 1,2,48,414720,270888468480000,30900096179361042923520000000000,
%T A166475 1848494880770448654906901042987600267878400000000000000000000
%N A166475 4th level primorials: product of first n superduperprimorials.
%C A166475 Next term has 110 digits.
%C A166475 a(n) = first counting number with n distinct positive tetrahedral exponents in its prime factorization (cf. A000292).
%C A166475 Note: a(n) is not the first counting number with n distinct square exponents in its prime factorization, as previously stated. That sequence is A212170. - _Matthew Vandermast_, May 23 2012
%H A166475 Dario Alpern, <a href="https://www.alpertron.com.ar/ecm.htm">Factorization using the Elliptic Curve Method</a>
%F A166475 a(n) = Product_{k=1..n} prime(k)^((n-k+1)^2).
%e A166475 a(3) = 414720 = 2^10*3^4*5^1 has 3 positive tetrahedral exponents in its prime factorization (cf. A000292). It is the smallest number with this property.
%Y A166475 Subsequence of A025487.
%Y A166475 Cf. A002110, A006939, A066120 for first, second and third level primorials.
%K A166475 nonn,easy
%O A166475 0,2
%A A166475 _Matthew Vandermast_, Nov 05 2009
%E A166475 Offset corrected by _Matthew Vandermast_, Nov 07 2009
%E A166475 Edited by _Matthew Vandermast_, Nov 10 2009, May 23 2012
%E A166475 Name changed by _Arkadiusz Wesolowski_, Feb 21 2014