The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #6 Nov 10 2015 11:13:15
%S 8,360,19845,395280,10764800,324210304,9863496016,279809075700,
%T 8157568320000,238979576637900,7001055126046864,204177934975626752,
%U 5968556502961102848,174493143469741118400,5100928646184033070545
%N 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 2,1.
%C Row 4 of A264195.
%H R. H. Hardin, <a href="/A264198/b264198.txt">Table of n, a(n) for n = 1..89</a>
%e Some solutions for n=3
%e ..2..3..0..1....2..3..0..1....9..3..0..1....2..3..0..1....9..1..0..3
%e ..6..5.15..7...13..7.15..5....6..5.15..7...13..5.15..7...13..7..4..5
%e .17..9.10.11...10.11.19..9...17.11.10..2....8.11.10..9...10.11..8..2
%e .14..4.12.13...14..4.12..6...14..4.12.13...14..4.12..6...14.15.12..6
%e .18..8.16.19...16..8.18.17...18..8.16.19...16.17.18.19...16.17.18.19
%Y Cf. A264195.
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 07 2015