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 A264645 #3 Nov 19 2015 13:54:20 %S A264645 1,6,149,5080,364544,46305472,6958619648 %N A264645 Number of 3Xn arrays of permutations of 0..n*3-1 with rows nondecreasing modulo 3 and columns nondecreasing modulo 4. %C A264645 Row 3 of A264643. %e A264645 Some solutions for n=4 %e A264645 ..9..0..4..1....4..1..5..8....0..4.10..8....9..0..6..4....0.11..5..8 %e A264645 .11..2..8..5....0..9..3..2....9..1..7..5...10..1..2..8....4..7..1..2 %e A264645 ..3..6..7.10....6.10..7.11....6..3.11..2....3..7.11..5....9..3..6.10 %Y A264645 Cf. A264643. %K A264645 nonn %O A264645 1,2 %A A264645 _R. H. Hardin_, Nov 19 2015