The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #6 Nov 10 2015 11:34:02
%S 169,10933,707281,33729146,1608491236,80568542340,4035639032100,
%T 200983996390320,10009459836154944,498478049285216352,
%U 24824552941574755216,1236574408590216008500,61596930731403632640625
%N Number of (5+1)X(n+1) arrays of permutations of 0..n*6+5 with each element having index change +-(.,.) 0,0 1,0 or 1,2.
%C Row 5 of A264272.
%H R. H. Hardin, <a href="/A264276/b264276.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=2
%e ..3..1..2....3..1..5....5..4..2....5..1..2....3..1..2....0..4..2....5..4..2
%e ..0..4..5....0..4..2....3..1..0....6..7..0....0..4..8....3..1..8....6..1..0
%e ..6.10..8....6..7..8....6.10.11...11..4..3....9.10..5....9..7..5....3.10.11
%e ..9..7.11....9.10.11....9..7..8...14.10..8....6..7.11....6.13.14....9..7..8
%e .15.13.14...15.13.14...15.16.17...12.13..9...12.13.17...17.10.11...12.16.14
%e .12.16.17...12.16.17...12.13.14...15.16.17...15.16.14...15.16.12...15.13.17
%Y Cf. A264272.
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 10 2015