|
%I #6 Nov 10 2015 11:17:39
%S 32,2197,144000,5953600,302693857,15238898080,758116015189,
%T 37756295112768,1881340543397700,93844626018289844,
%U 4671287670607109136,232749311970413840980,11592531860936526641824,577455315370687153595250
%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,-2 or 1,1.
%C Row 5 of A264142.
%H R. H. Hardin, <a href="/A264145/b264145.txt">Table of n, a(n) for n = 1..18</a>
%e Some solutions for n=3
%e ..0..1..7..3....0..1..7..3....0..6..7..3....0..1..4..3....0..1..4..5
%e ..2.10..8..9....9.10..8..2....9..5..1..2....2..5..8..7....2..3..8..7
%e ..6..4..5.11...13..4..5..6....8..4.12.13....6..9.10.13....6..9.12.11
%e .12.13.16.17...12.11.14.15...10.11.14.17...17.11.14.15...10.13.16.17
%e .14.15.20.19...16.22.20.21...16.15.18.19...21.12.23.19...14.15.18.19
%e .18.21.22.23...18.19.17.23...20.21.22.23...20.16.22.18...20.21.22.23
%Y Cf. A264142.
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 04 2015
| 