|
%I #5 Nov 10 2015 12:21:19
%S 60,24091,2736666,248766606,25103852988,2343241421547,205448127753536,
%T 17380243003632168,1440197440806112088,116813202818782845844,
%U 9335200652683628893145
%N Number of (4+1)X(n+1) arrays of permutations of 0..n*5+4 filled by rows with each element moved a city block distance of 0 or 2, and rows and columns in increasing lexicographic order.
%C Row 4 of A263602.
%e Some solutions for n=2
%e ..0..3..4....0..1..8....0..5..8....0..3..8....0..3..8....0..1..8....0..3..8
%e ..1..2.11....3..4.11....1..4..3....1..2..5....1.10..7....3..2.11....1..2..5
%e .12..7.10....6..5..2...10.13..2...10..9..4....4..9..2....6..5..4....4.13..6
%e .13..6..5....7.10..9...11..6..9...11..6..7...11..6..5....7.10.13...11.14..9
%e .14..9..8...12.13.14...12..7.14...14.13.12...14.13.12...14..9.12...12..7.10
%Y Cf. A263602.
%K nonn
%O 1,1
%A _R. H. Hardin_, Oct 22 2015
| 