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 A264135 #6 Nov 10 2015 11:06:47 %S A264135 1,89,7921,178000,4000000,160564000,6445199524,219637743496, %T A264135 7484754845584,273712171834464,10009459836154944,358827105960491520, %U A264135 12863520517551001600,465176569014432986560,16821929895847549418521 %N A264135 Number of (4+1)X(n+1) arrays of permutations of 0..n*5+4 with each element having index change +-(.,.) 0,0 0,2 or 1,2. %C A264135 Row 4 of A264131. %H A264135 R. H. Hardin, <a href="/A264135/b264135.txt">Table of n, a(n) for n = 1..20</a> %e A264135 Some solutions for n=4 %e A264135 ..0..3..4..1..2....0..8..4..3..2....0..3..4..1..2....0..1..9..3..4 %e A264135 ..7..6..5..8..9....5..6..9..1..7....5..6..7..8..9....5.13..7..8..2 %e A264135 .10.13.14.11.12...12.18.10.13.14...12.18.10.13.14...12.11.10..6.14 %e A264135 .15.18.19.16.17...22.16.15.11.19...15.23.24.11.19...17.16.15.18.19 %e A264135 .20.21.24.23.22...20.21.24.23.17...20.21.22.16.17...20.23.22.21.24 %Y A264135 Cf. A264131. %K A264135 nonn %O A264135 1,2 %A A264135 _R. H. Hardin_, Nov 03 2015