|
%I #6 Nov 10 2015 12:28:30
%S 18,3035,145151,8296414,479355276,24453863816,1173005308130,
%T 54380015507778,2444489580748461,107205187820814508,
%U 4615557211555598479,195894558236312186300,8220519759791018782780,341888951779349913222920
%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 1 or 2, and rows and columns in increasing lexicographic order.
%C Row 3 of A263586.
%H R. H. Hardin, <a href="/A263589/b263589.txt">Table of n, a(n) for n = 1..59</a>
%e Some solutions for n=3
%e ..1..4..6.11....1..4..6.11....1..2..3..7....1..4..5.11....1..4.10.11
%e ..9..0..2.10....8..0..5.15....9..0..4..6....8..0.10..3....9..0..7..2
%e .12..8.15..3...10.12..2..3...12.10..8.15...12.14..2..6...12..5..6..3
%e .14..5.13..7...14..9.13..7...13..5.11.14...13..9.15..7...14..8.15.13
%Y Cf. A263586.
%K nonn
%O 1,1
%A _R. H. Hardin_, Oct 22 2015
| 