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 A263441 #4 Oct 18 2015 11:02:30 %S A263441 1,4,49,1770,52352,1095488,20725780,482961978,11815143411, %T A263441 287647951708,6707640025800,157137244838144,3691446486456184, %U A263441 87568971473535200,2068832357068222368,48886506679849706508,1152745723771781775300 %N A263441 Number of nX3 arrays of permutations of 0..n*3-1 with each element moved a city block distance of 0 or 3. %C A263441 Column 3 of A263442. %H A263441 R. H. Hardin, <a href="/A263441/b263441.txt">Table of n, a(n) for n = 1..31</a> %e A263441 Some solutions for n=4 %e A263441 ..9..8..7....0..6..2....0..6.11....7.10..2....5..8.11....5..1.11....7..8..3 %e A263441 ..3..4..5....3.11.10....8..9.10....3.11..6...10..9..0....2..9..0....2.11..6 %e A263441 ..6..2..1....5..7..9....5..7..1....1..0..9....6..7..3....6..7..3....5..0..1 %e A263441 ..0.10.11....8..1..4....4..3..2....8..5..4....4..1..2....8.10..4....9.10..4 %Y A263441 Cf. A263442. %K A263441 nonn %O A263441 1,2 %A A263441 _R. H. Hardin_, Oct 18 2015