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 A329021 #59 Feb 04 2022 13:31:53
%S A329021 1,2,44,4332,1012664,432457640,293661065788,290711372717976,
%T A329021 395320344293410544,707125993042984343136,1609908874238209683872480,
%U A329021 4545914321591993313415189408,15591582457233317184439165505544,63847180690107503874880321918389332
%N A329021 a(n) is the constant term in the expansion of ( Sum_{k=1..n} x_k^(2*k-1) + x_k^(-(2*k-1)) )^(2*n).
%H A329021 Seiichi Manyama, <a href="/A329021/b329021.txt">Table of n, a(n) for n = 0..100</a>
%F A329021 a(n) = A077045(2*n).
%F A329021 a(n) = Sum_{k=0..floor((2*n-1)/2)} (-1)^k*binomial(2*n,k)*binomial((2*n+1)*n-2*n*k-1,(2*n-1)*n-2*n*k) for n > 0.
%F A329021 a(n) ~ sqrt(3) * 2^(2*n - 1) * n^(2*n - 3/2) / sqrt(Pi). - _Vaclav Kotesovec_, Feb 04 2022
%e A329021 (x + 1/x)^2 = x^2 + 2 + 1/x^2. So a(1) = 2.
%t A329021 a[0] = 1; a[n_] := Sum[(-1)^k * Binomial[2*n, k] * Binomial[(2*n + 1)*n - 2*n*k - 1, (2*n - 1)*n - 2*n*k], {k, 0, Floor[n - 1/2]}]; Array[a, 14, 0] (* _Amiram Eldar_, May 06 2021 *)
%o A329021 (PARI) {a(n) = polcoef((sum(k=1, n, x^(2*k-1)+x^(-(2*k-1))))^(2*n), 0)}
%o A329021 (PARI) {a(n) = if(n==0, 1, sum(k=0,(2*n-1)\2, (-1)^k*binomial(2*n, k)*binomial((2*n+1)*n-2*n*k-1, (2*n-1)*n-2*n*k)))}
%Y A329021 Main diagonal of A329020.
%Y A329021 Cf. A077045.
%K A329021 nonn
%O A329021 0,2
%A A329021 _Seiichi Manyama_, Nov 02 2019