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 A264193 #6 Nov 10 2015 11:11:12 %S A264193 81,4608,262144,10764800,442050625,19169627850,831295356516, %T A264193 35638188122016,1527832968950016,65670947717590800, %U A264193 2822738782165680625,121309079019352675425,5213338458910861518801,224053338609946318965300 %N A264193 Number of (n+1)X(5+1) arrays of permutations of 0..n*6+5 with each element having index change +-(.,.) 0,0 0,2 or 2,1. %C A264193 Column 5 of A264195. %H A264193 R. H. Hardin, <a href="/A264193/b264193.txt">Table of n, a(n) for n = 1..194</a> %F A264193 Empirical: a(n) = 43*a(n-1) -a(n-2) +6304280137*a(n-8) -271084045891*a(n-9) +6304280137*a(n-10) -21506471693602896*a(n-16) +924778282824924528*a(n-17) -21506471693602896*a(n-18) +39722441580383416010*a(n-24) -1708064987956486888430*a(n-25) +39722441580383416010*a(n-26) -39722441580383416010*a(n-32) +1708064987956486888430*a(n-33) -39722441580383416010*a(n-34) +21506471693602896*a(n-40) -924778282824924528*a(n-41) +21506471693602896*a(n-42) -6304280137*a(n-48) +271084045891*a(n-49) -6304280137*a(n-50) +a(n-56) -43*a(n-57) +a(n-58) %e A264193 Some solutions for n=2 %e A264193 .13..3.15..1..2..5....0..3..2.16..4..5....2..1..0..5..4..3....2.14..0..3..4..5 %e A264193 ..6..9..8..7.10.11....6..7..8..9.10.11....6..9..8..7.10.11....6..9.10..7..8.11 %e A264193 .12..0.16.17.14..4...12.15..1.13.14.17...14.13.12.15.16.17...12.13..1.15.16.17 %Y A264193 Cf. A264195. %K A264193 nonn %O A264193 1,1 %A A264193 _R. H. Hardin_, Nov 07 2015