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 A329964 #11 Dec 04 2022 08:32:57
%S A329964 1,1,1,9,16,400,900,44100,112896,9144576,25401600,3073593600,
%T A329964 9032601600,1526509670400,4674935865600,1051860569760000,
%U A329964 3324398837760000,960751264112640000,3112834095724953600,1123733108556708249600,3714820193575895040000
%N A329964 a(n) = (n!/floor(1+n/2)!)^2.
%F A329964 a(n) = A262033(n)^2.
%F A329964 Sum_{n>=0} 1/a(n) = 29/16 + (3/16)*Pi*StruveL(-1, 1/2) + (57/64)*Pi*StruveL(0, 1/2) + (1/4)*Pi*StruveL(1, 1/2), where StruveL is the modified Struve function. - _Amiram Eldar_, Dec 04 2022
%p A329964 A329964 := n -> (n!/floor(1+n/2)!)^2:
%p A329964 seq(A329964(n), n=0..20);
%t A329964 a[n_] := (n!/Floor[1 + n/2]!)^2; Array[a, 20, 0] (* _Amiram Eldar_, Dec 04 2022 *)
%Y A329964 Cf. A262033.
%K A329964 nonn
%O A329964 0,4
%A A329964 _Peter Luschny_, Dec 04 2019