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 A290770 #18 Feb 16 2025 08:33:50
%S A290770 1,1,16,11664,764411904,7464960000000000,16249593066946560000000000,
%T A290770 11020848942410302096869949440000000000,
%U A290770 3102093199396597590886754340698424229232640000000000,465607547420733489126893933985879279492195953053596584509440000000000
%N A290770 a(n) = Product_{k=1..n} k^(2*k).
%H A290770 G. C. Greubel, <a href="/A290770/b290770.txt">Table of n, a(n) for n = 0..27</a>
%H A290770 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Hyperfactorial.html">Hyperfactorial</a>
%H A290770 <a href="/index/Fa#factorial">Index entries for sequences related to factorial numbers</a>
%F A290770 a(n) = A002109(n)^2.
%F A290770 a(n) = A185141(n)/A000178(n-1)^2 for n > 0.
%F A290770 a(n) = (n!)^(2*n)/G(n+1)^2, where G() is the Barnes G-function.
%F A290770 a(n) ~ A^2*exp(-n^2/2)*n^(n*(n+1))*n^(1/6), where A is the Glaisher-Kinkelin constant (A074962).
%t A290770 Table[Product[k^(2 k), {k, 1, n}], {n, 0, 9}]
%t A290770 Table[Hyperfactorial[n]^2, {n, 0, 9}]
%t A290770 Table[n!^(2 n)/BarnesG[n + 1]^2, {n, 0, 9}]
%o A290770 (PARI) a(n) = prod(k=1, n, k^(2*k)) \\ _Felix Fröhlich_, Aug 10 2017
%o A290770 (Magma) [1] cat [(&*[k^(2*k): k in [1..n]]): n in [1..10]]; // _G. C. Greubel_, Oct 14 2018
%Y A290770 Cf. A000178, A001044, A001818, A002109, A051675, A055209, A061742, A062206, A074962, A184877, A185141, A260122.
%K A290770 nonn,easy
%O A290770 0,3
%A A290770 _Ilya Gutkovskiy_, Aug 10 2017