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 A324438 #21 Dec 08 2023 04:55:16
%S A324438 1,2,139392,305013568273920000,
%T A324438 1174837791623127613548781790822400000000,
%U A324438 139642003782073074626249921818187528362524804267528306032640000000000000
%N A324438 a(n) = Product_{i=1..n, j=1..n} (i^5 + j^5).
%F A324438 a(n) ~ c * 2^(2*n*(n+1)) * phi^(sqrt(5)*n*(n+1)) * exp(Pi*sqrt(phi)*n*(n+1)/5^(1/4) - 15*n^2/2) * n^(5*n^2 - 5/4), where phi = A001622 = (1+sqrt(5))/2 is the golden ratio and c = 0.1574073828647726237455544898360432469056972905505624900871695...
%F A324438 a(n) = A367679(n) * A079478(n). - _Vaclav Kotesovec_, Nov 26 2023
%F A324438 For n>0, a(n)/a(n-1) = A272248(n)^2 / (2*n^15). - _Vaclav Kotesovec_, Dec 02 2023
%p A324438 a:= n-> mul(mul(i^5 + j^5, i=1..n), j=1..n):
%p A324438 seq(a(n), n=0..5); # _Alois P. Heinz_, Nov 26 2023
%t A324438 Table[Product[i^5 + j^5, {i, 1, n}, {j, 1, n}], {n, 1, 6}]
%o A324438 (Python)
%o A324438 from math import prod, factorial
%o A324438 def A324438(n): return prod(i**5+j**5 for i in range(1,n) for j in range(i+1,n+1))**2*factorial(n)**5<<n # _Chai Wah Wu_, Nov 26 2023
%Y A324438 Cf. A079478, A324403, A324426, A324437, A324439, A324440, A367834.
%Y A324438 Cf. A272248, A367679.
%K A324438 nonn
%O A324438 0,2
%A A324438 _Vaclav Kotesovec_, Feb 28 2019
%E A324438 a(0)=1 prepended by _Alois P. Heinz_, Nov 26 2023