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 A318397 #9 Aug 25 2018 21:20:40
%S A318397 1,2,1,6,8,1,20,54,18,1,70,320,216,32,1,252,1750,2000,600,50,1,924,
%T A318397 9072,15750,8000,1350,72,1,3432,45276,111132,85750,24500,2646,98,1,
%U A318397 12870,219648,724416,790272,343000,62720,4704,128,1,48620,1042470,4447872,6519744,4000752,1111320,141120,7776,162,1
%N A318397 Triangle read by rows: T(n,k) = binomial(n,k)^2 * binomial(2*(n-k), n-k).
%C A318397 The square of the triangular matrix {binomial(n, k)^2}_{k=0..n} A008459 read by rows.
%e A318397 Triangle begins:
%e A318397 1
%e A318397 2 1
%e A318397 6 8 1
%e A318397 20 54 18 1
%e A318397 70 320 216 32 1
%e A318397 ...
%t A318397 T[ n_, k_] := Binomial[n, k]^2 Binomial[2 n - 2 k, n - k];
%o A318397 (PARI) {T(n, k) = binomial(n, k)^2 * binomial(2*(n-k), n-k)};
%Y A318397 Row sums give A002893.
%Y A318397 Cf. A008459.
%K A318397 nonn,tabl,easy
%O A318397 0,2
%A A318397 _Michael Somos_, Aug 25 2018