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 A267283 #3 Jan 12 2016 16:03:07 %S A267283 1,462,13767,741057,79348962,13687472182 %N A267283 Number of nX(n+4) arrays of permutations of n+4 copies of 0..n-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo n and the upper left element equal to 0. %C A267283 Superdiagonal 4 of A267278. %e A267283 Some solutions for n=3 %e A267283 ..0..0..0..1..2..2..0....0..1..2..0..0..1..2....0..0..1..1..2..2..0 %e A267283 ..0..0..1..1..1..2..0....1..1..2..2..0..1..2....0..1..1..2..2..0..0 %e A267283 ..2..1..1..1..2..2..2....0..1..2..0..0..1..2....1..0..2..1..2..2..1 %Y A267283 Cf. A267278. %K A267283 nonn %O A267283 1,2 %A A267283 _R. H. Hardin_, Jan 12 2016