The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #6 Nov 10 2015 11:28:09
%S 16,714,44100,1086300,39087504,1399892079,52292712976,1831421933904,
%T 66243207054049,2385778207943925,86357642070757264,
%U 3110154362286189952,112317001186568833600,4054235148417380879616,146425185170008290357529
%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 1,1.
%C Row 4 of A264110.
%H R. H. Hardin, <a href="/A264114/b264114.txt">Table of n, a(n) for n = 1..18</a>
%e Some solutions for n=3
%e ..0..3..7..1....2..3..0..1....0..1..2..3....0..6..7..3....5..1..2..3
%e ..9..5..4..2....4..7..6..5....9..5..6..7....4..5..1..2....6..0.11..7
%e .13.11.15..6....8.11.10..9...13..4.15.11....8.11.10..9....8..4.10..9
%e .14..8.12.10...17.15.19.13...12..8.14.10...17.15.19.13...14.15.19.13
%e .18.17.16.19...18.12.16.14...16.19.18.17...16.12.18.14...18.12.16.17
%Y Cf. A264110.
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 03 2015