|
%I #6 Nov 10 2015 12:26:11
%S 6,134,3035,69084,1643235,38562523,903637375,21206120278,497781904012,
%T 11682193577941,274165517770655,6434456922985871,151011586126096748,
%U 3544112130933243384,83177316133805461631,1952101836234127241441
%N Number of (n+1)X(2+1) arrays of permutations of 0..n*3+2 filled by rows with each element moved a city block distance of 1 or 2, and rows and columns in increasing lexicographic order.
%C Column 2 of A263586.
%H R. H. Hardin, <a href="/A263583/b263583.txt">Table of n, a(n) for n = 1..210</a>
%H R. H. Hardin, <a href="/A263583/a263583.txt">Empirical recurrence of order 84</a>
%F Empirical recurrence of order 84 (see link above)
%e Some solutions for n=4
%e ..1..3..4....1..3..8....2..3..5....2..5..8....1..2..8....1..2..4....2..4..5
%e ..6..0..2....6..0..2....6..0..7....6..0..1....5..0..3....6..0..8....6..0..3
%e ..7.11.14...10..5..4....9..1.14...10..3..4....9.10..6....9..3..5...10..1.14
%e .12..8..5...13..9..7...12..4..8...13.12..7...11..4.14...11..7.10...12..7..8
%e .13..9.10...14.11.12...13.10.11...14..9.11...13..7.12...13.14.12...13..9.11
%Y Cf. A263586.
%K nonn
%O 1,1
%A _R. H. Hardin_, Oct 22 2015
| 