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 A263970 #6 Nov 10 2015 10:28:35 %S A263970 108,1817,86633,2940624,118376593,4465927225,173624682220, %T A263970 6667558559121,257455940562569,9918270812153408,382479262941692449, %U A263970 14743229754402141217,568405954625127696140,21912390582420380574169 %N A263970 Number of (n+1)X(3+1) arrays of permutations of 0..n*4+3 with each element having index change (+-,+-) 0,2 1,1 or 1,0. %C A263970 Column 3 of A263973. %H A263970 R. H. Hardin, <a href="/A263970/b263970.txt">Table of n, a(n) for n = 1..210</a> %F A263970 Empirical: a(n) = 48*a(n-1) -111*a(n-2) -13143*a(n-3) +131701*a(n-4) +59295*a(n-5) -4720800*a(n-6) +12779427*a(n-7) +19382471*a(n-8) -116442296*a(n-9) +280725335*a(n-10) -381462119*a(n-11) -578575706*a(n-12) +1756342049*a(n-13) -3626876273*a(n-14) +4852378354*a(n-15) +1964306003*a(n-16) -4666835695*a(n-17) +1402574008*a(n-18) -678640843*a(n-19) +169204617*a(n-20) +35040960*a(n-21) -9205311*a(n-22) +2141847*a(n-23) -540093*a(n-24) -13833*a(n-25) +11952*a(n-26) -675*a(n-27) %e A263970 Some solutions for n=3 %e A263970 ..2..4..6..1....5..3..0..7....4..6..0..7....4..3..5..1....5..4..0..1 %e A263970 ..0..7..3.10....1..2..9.10....1..2.10..3....0.10..9..2....9..2..3.10 %e A263970 ..5.13.15..9...13..4..6.15....5.11.15.14...12..6.14..7...13.14..6..7 %e A263970 .14..8.12.11...14..8.12.11....8..9.12.13....8.15.11.13....8.15.12.11 %Y A263970 Cf. A263973. %K A263970 nonn %O A263970 1,1 %A A263970 _R. H. Hardin_, Oct 30 2015