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 A264061 #6 Nov 10 2015 10:58:38 %S A264061 1,45,2025,32400,518400,11151360,239878144,4614184960,88756326400, %T A264061 1773696512000,35445352960000,699751279718400,13814275005812736, %U A264061 273958624952463360,5433026934403993600,107577300516952780800 %N A264061 Number of (4+1)X(n+1) arrays of permutations of 0..n*5+4 with each element having index change +-(.,.) 0,0 1,2 or 2,-2. %C A264061 Row 4 of A264059. %H A264061 R. H. Hardin, <a href="/A264061/b264061.txt">Table of n, a(n) for n = 1..210</a> %F A264061 Empirical: a(n) = 19*a(n-1) +16*a(n-2) -2366480*a(n-6) +44963120*a(n-7) +37863680*a(n-8) +238086819840*a(n-12) -4523649576960*a(n-13) -3809389117440*a(n-14) +975203614064640*a(n-18) -18528868667228160*a(n-19) -15603257825034240*a(n-20) -162623267306209280*a(n-24) +3089842078817976320*a(n-25) +2601972276899348480*a(n-26) -1152921504606846976*a(n-30) +21905508587530092544*a(n-31) +18446744073709551616*a(n-32) %e A264061 Some solutions for n=4 %e A264061 ..0..1..2..3..4....0..1.10..3..4....7..8..9.11.12....0..1..9..3..4 %e A264061 .12..6.14..8.17....5.13.14.16..2....5..6..0..1..2....5..6.15.16..2 %e A264061 .10.18..5.13..7...17.11.20..6.22...10..3..4.13.14...10.11.19.13.14 %e A264061 .15.23..9.11.19....7..8..9.18.19...22.16.17.18.19....7..8.17.18.12 %e A264061 .20.21.22.16.24...12.21.15.23.24...20.21.15.23.24...20.21.22.23.24 %Y A264061 Cf. A264059. %K A264061 nonn %O A264061 1,2 %A A264061 _R. H. Hardin_, Nov 02 2015