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 A268365 #5 Aug 11 2016 20:20:17 %S A268365 1,36,2700,643680,190188000,128247235200,114921318153600, %T A268365 164433011758848000,312067875406065408000,867549791919350615040000, %U A268365 2986581009309337422259200000 %N A268365 Number of n X 4 arrays of permutations of 4 copies of 0..n-1 with row sums equal. %C A268365 Column 4 of A268367. %e A268365 Some solutions for n=3 %e A268365 ..0..0..2..2....0..2..2..0....1..2..0..1....0..2..0..2....1..1..2..0 %e A268365 ..1..1..0..2....0..1..2..1....2..0..2..0....1..1..2..0....0..2..1..1 %e A268365 ..2..1..0..1....1..0..1..2....1..2..0..1....1..0..1..2....0..2..0..2 %Y A268365 Cf. A268367. %K A268365 nonn %O A268365 1,2 %A A268365 _R. H. Hardin_, Feb 03 2016