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 A263975 #6 Nov 10 2015 10:31:55 %S A263975 16,1441,86633,2604481,102742049,4952396901,224559467921, %T A263975 9479627840080,407499168253313,17951972257163801,787313274461726480, %U A263975 34237567537967020880,1490472641241784860976,65073777514668815019417 %N A263975 Number of (3+1)X(n+1) arrays of permutations of 0..n*4+3 with each element having index change (+-,+-) 0,2 1,1 or 1,0. %C A263975 Row 3 of A263973. %H A263975 R. H. Hardin, <a href="/A263975/b263975.txt">Table of n, a(n) for n = 1..92</a> %e A263975 Some solutions for n=3 %e A263975 ..2..4..0..7....2..3..5..7....5..3..0..7....5..3..0..7....2..3..0..6 %e A263975 ..1..8..3.11....6..0..1.10....8..1.10..2....6..2..1.10....1..7..9..5 %e A263975 .13.12..5..6...13..4..8.14....4.12..6.14....4.12.13.14...12..4..8.15 %e A263975 .14.15..9.10....9.15.12.11....9.15.11.13....8.15..9.11...14.10.11.13 %Y A263975 Cf. A263973. %K A263975 nonn %O A263975 1,1 %A A263975 _R. H. Hardin_, Oct 30 2015