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 A265092 #11 Feb 26 2018 03:09:03 %S A265092 1,2,12,4464,75502080 %N A265092 Number of n X n arrays containing n copies of 0..n-1 with row sums equal and column sums equal. %C A265092 Diagonal of A265089. %C A265092 Cf. Latin squares A002860. %e A265092 Some solutions for n=4 %e A265092 ..0..2..1..3....3..3..0..0....3..1..2..0....1..0..2..3....2..1..0..3 %e A265092 ..3..1..2..0....0..2..3..1....2..3..1..0....2..3..1..0....3..1..2..0 %e A265092 ..0..2..1..3....1..1..1..3....0..2..1..3....1..3..2..0....1..2..3..0 %e A265092 ..3..1..2..0....2..0..2..2....1..0..2..3....2..0..1..3....0..2..1..3 %Y A265092 Cf. A265089, A002860. %K A265092 nonn,more %O A265092 1,2 %A A265092 _R. H. Hardin_, Dec 01 2015