|
%I #6 Nov 10 2015 12:24:37
%S 360,78306,8349744,830632993,77648070968,6600176727615,
%T 524879929370969,39815156080534246,2908492519199212125,
%U 206237888061029906090,14285559566492289032473,971180901984331067176513
%N Number of (3+1)X(n+1) arrays of permutations of 0..n*4+3 filled by rows with each element moved a city block distance of 0 1 or 2, and rows and columns in increasing lexicographic order.
%C Row 3 of A263506.
%H R. H. Hardin, <a href="/A263509/b263509.txt">Table of n, a(n) for n = 1..51</a>
%e Some solutions for n=2
%e ..0..3..4....0..3..5....0..7..8....0..1..2....0..1..4....0..3..4....0..1..4
%e ..1..5.11....1..8..2....3..2..1....5..3..4....3..6..5....6..1..2....3..2..5
%e ..8..6..2....4..7.11....4.11.10....9..7..6...10..7..2....9..8..5....6..7..8
%e ..9.10..7....6.10..9....9..6..5...11.10..8...11..9..8...11..7.10...10.11..9
%Y Cf. A263506.
%K nonn
%O 1,1
%A _R. H. Hardin_, Oct 19 2015
| 