%I #6 Nov 10 2015 11:22:50

%S 16,169,2401,32761,456976,6355441,88529281,1232922769,17172529936,

%T 239180661721,3331358690401,46399815451081,646266084871696,

%U 9001325016847969,125372284530501121,1746210653453054881

%N Number of (3+1)X(n+1) arrays of permutations of 0..n*4+3 with each element having index change +-(.,.) 0,0 0,1 or 2,-2.

%C Row 3 of A264090.

%H R. H. Hardin, <a href="/A264092/b264092.txt">Table of n, a(n) for n = 1..210</a>

%F Empirical: a(n) = 14*a(n-1) +14*a(n-2) -210*a(n-3) +210*a(n-5) -14*a(n-6) -14*a(n-7) +a(n-8)

%e Some solutions for n=4

%e ..0..1..3..4.12....1..0.10..3.12....1..0.10.11..4....1..0..2..4..3

%e ..6..5..8..7..9....5..7..6..8.17....5..6.15..8..9....6..5..7..9..8

%e ..2.10.11.14.13....2.11..4.13.14....2..3.12.13.14...11.10.12.14.13

%e .16.15.17.19.18...16.15..9.18.19....7.17.16.19.18...16.15.17.18.19

%Y Cf. A264090.

%K nonn

%O 1,1

%A _R. H. Hardin_, Nov 03 2015