%I #6 Nov 10 2015 10:26:53
%S 25,1685,95161,3801496,180329601,8793791605,417374263952,
%T 19718635628325,935640860916425,44391937106866449,2104497816698168833,
%U 99772475347949387221,4730590358279991615088,224290743715077656954960
%N Number of (3+1)X(n+1) arrays of permutations of 0..n*4+3 with each element having index change (+-,+-) 0,0 1,1 or 1,2.
%C Row 3 of A263964.
%H R. H. Hardin, <a href="/A263967/b263967.txt">Table of n, a(n) for n = 1..60</a>
%e Some solutions for n=3
%e ..0..1..5..3....6..1..5..3....6..4..7..5....5..1..2..3....0..1..7..3
%e ..4..2..8..9....4..2..0..9....1..0..3..2...10..0..8..7....4..2..8.10
%e .13.14..7..6...14..7.12.13...14..9.10.13...14..4.15..6...13..9..5..6
%e .12.10.11.15...10.11..8.15...12.11..8.15...12.13.11..9...12.11.14.15
%Y Cf. A263964.
%K nonn
%O 1,1
%A _R. H. Hardin_, Oct 30 2015