|
%I #5 Nov 10 2015 12:28:53
%S 70,69084,14088801,3822509358,1035523589834,244734723702847,
%T 54806224439043377
%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 1 or 2, and rows and columns in increasing lexicographic order.
%C Row 4 of A263586.
%e Some solutions for n=2
%e ..1..2..4....2..3..4....2..3..4....1..3..4....1..2..5....1..3..8....1..4..8
%e ..9..0..8....6..0..1....6..0..7....7..0..2....6..0..4....4..0..2....5..0..2
%e .10..3..7....9..5.11....8..1..5....9..5..6....8..3.10....9..5..7....9..3.10
%e .13..6..5...13.12..8...11.12.14...12.13..8...12.13..9...10..6.14...12..6.13
%e .14.12.11...14..7.10...13..9.10...14.11.10...14..7.11...13.12.11...14..7.11
%Y Cf. A263586.
%K nonn
%O 1,1
%A _R. H. Hardin_, Oct 22 2015
| 