%I #6 Nov 10 2015 12:16:13
%S 66,1198,25968,489294,9051857,162207955,2861438066,49842444849,
%T 860844781350,14774845188752,252437172412114,4298676558542165,
%U 73021464693301088,1238164128738016241,20966325620945097786
%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 1, and rows and columns in increasing lexicographic order.
%C Row 4 of A263519.
%H R. H. Hardin, <a href="/A263522/b263522.txt">Table of n, a(n) for n = 1..210</a>
%H R. H. Hardin, <a href="/A263522/a263522.txt">Empirical recurrence of order 92</a>
%F Empirical recurrence of order 92 (see link above)
%e Some solutions for n=3
%e ..0..1..2..7....0..2..6..7....0..1..2..3....0..5..6..7....0..5..6..7
%e ..4..6..5..3....4..1.10..3....5..4..7..6....4..1..2..3....4..1..2..3
%e ..9..8.10.11....8..5..9.11....8.13..9.11....9..8.11.10....9..8.11.10
%e .13.12.15.14...13.12.14.15...12.17.10.14...13.12.14.19...13.12.14.15
%e .17.16.18.19...17.16.19.18...16.18.19.15...16.17.18.15...16.18.17.19
%Y Cf. A263519.
%K nonn
%O 1,1
%A _R. H. Hardin_, Oct 19 2015