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 A268362 #8 Apr 14 2020 21:35:46 %S A268362 1,4,216,643680,269568000000,39489843246336000000, %T A268362 2716675055795577271091911200000, %U A268362 130980129445039212210880200374052628780800000 %N A268362 Number of n X n arrays containing n copies of 0..n-1 with row sums equal. %C A268362 Diagonal of A268367. %e A268362 Some solutions for n=3 %e A268362 ..1..2..0....0..2..1....0..2..1....0..2..1....1..0..2....2..0..1....1..0..2 %e A268362 ..1..0..2....1..2..0....0..2..1....1..0..2....1..2..0....2..0..1....0..2..1 %e A268362 ..1..2..0....2..1..0....1..2..0....1..2..0....1..2..0....0..2..1....0..1..2 %Y A268362 Cf. A268367. %K A268362 nonn %O A268362 1,2 %A A268362 _R. H. Hardin_, Feb 03 2016