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 A061778 #18 Feb 26 2022 14:35:09
%S A061778 1,2,3,24,50,1800,5145,878080,3429216,2857680000,15219319500,
%T A061778 63117561830400,457937132487120,9577928124440387712,
%U A061778 94609025993497640625,10077943267571584204800000
%N A061778 a(n) = Product_{j=0..floor(n/2)} binomial(n,j).
%H A061778 Harry J. Smith, <a href="/A061778/b061778.txt">Table of n, a(n) for n = 1..97</a>
%F A061778 For odd n, a(n) = sqrt(A001142(n)); for even n, (a(n)^2)/A001405(n) = A001142(n).
%e A061778 n=5: a(5) = 1*5*10 = 50;
%e A061778 n=6: a(6) = 1*6*15*20 = 1800. [corrected by _Jon E. Schoenfield_, Jul 01 2018]
%t A061778 Table[Apply[Times, Table[Binomial[n, j], {j, 0, Floor[n/2]}]], {w, 1, 20}]
%t A061778 Table[Product[Binomial[n,j],{j,0,Floor[n/2]}],{n,20}] (* _Harvey P. Dale_, Dec 06 2018 *)
%o A061778 (PARI) { for (n=1, 97, write("b061778.txt", n, " ", prod(j=0, n\2, binomial(n, j))) ) } \\ _Harry J. Smith_, Jul 27 2009
%o A061778 (GAP) List([1..20],n->Product([0..Int(n/2)],j->Binomial(n,j))); # _Muniru A Asiru_, Jul 01 2018
%Y A061778 Cf. A001142, A001405.
%K A061778 easy,nonn
%O A061778 1,2
%A A061778 _Labos Elemer_, Jun 22 2001