|
%I #6 Nov 10 2015 11:24:06
%S 128,12815,2401000,252076323,35960283125,4553473226652,
%T 607571415109250,79816211548612896,10556323931018748344,
%U 1393693934819346106625,184143877192923267915936,24325654371564673667158985
%N Number of (6+1)X(n+1) arrays of permutations of 0..n*7+6 with each element having index change +-(.,.) 0,0 0,1 or 2,-2.
%C Row 6 of A264090.
%H R. H. Hardin, <a href="/A264095/b264095.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=2
%e ..0..2..1....1..0..6....0..1..6....0..1..6....0..1..2....0..1..2....0..1..6
%e ..4..3..9....3..4..5....4..3..5....3..4..5....3..5..4....4..3..5....3..4..5
%e ..6..7.12....2..8..7....2..7.12....2..8..7....6..7.12....7..6..8....2..8..7
%e ..5.10.15....9.10.15...10..9.11...10..9.15...10..9.15....9.10.15....9.10.11
%e ..8.13.14...12.14.13....8.14.13...12.14.13....8.13.14...13.12.14...13.12.14
%e .11.16.17...11.17.16...15.17.16...11.17.16...11.16.17...11.17.16...16.15.17
%e .19.18.20...19.18.20...18.20.19...18.19.20...18.19.20...18.20.19...18.19.20
%Y Cf. A264090.
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 03 2015
| 