The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #4 Nov 11 2015 19:47:10
%S 64,4181,490000,27726581,2296230561,168990466353,13323150080401,
%T 1013466370660345,78811815228451548,6076970313680986922,
%U 470875474583958043505,36443115363342618926880,2822865567835490612412633
%N Number of (5+1)X(n+1) arrays of permutations of 0..n*6+5 with each element having index change +-(.,.) 0,0 0,1 or 1,2.
%C Row 5 of A264341.
%H R. H. Hardin, <a href="/A264345/b264345.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=2
%e ..5..2..1....1..0..2....1..0..2....1..0..2....1..0..2....1..0..2....5..1..2
%e ..4..3..0....3..5..4....8..5..4....3..5..4....4..3..5....3..5..4....3..4..0
%e ..6..7..8....6..7..8....7..6..3...11..8..7...11..8..7...11..8..7....6..7..8
%e .10..9.11....9.11.10....9.10.11....9.10..6...10..9..6...14.10..6...14.11.10
%e .12.13.14...13.12.14...17.14.13...17.13.14...13.12.14...12.13..9...12.13..9
%e .15.17.16...15.17.16...15.16.12...15.16.12...16.15.17...15.17.16...15.17.16
%Y Cf. A264341.
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 11 2015