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 A264705 #3 Nov 21 2015 08:07:04 %S A264705 1,3,15,212,3712,96256,3423168,158521536,8362014912,635861560320, %T A264705 51551078842368 %N A264705 Number of 2Xn arrays of permutations of 0..n*2-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 6. %C A264705 Row 2 of A264704. %e A264705 Some solutions for n=6 %e A264705 ..2..0..8.10..7..1....8..0..6..1..7..3....0..6..4..3..9..7....4..6..8..0..7..9 %e A264705 ..4..6..9.11..5..3....4.10..2..5.11..9....8..2.10..5.11..1...10..2.11..5..1..3 %Y A264705 Cf. A264704. %K A264705 nonn %O A264705 1,2 %A A264705 _R. H. Hardin_, Nov 21 2015