|
%I #6 Nov 10 2015 12:18:57
%S 15,1687,69792,2736666,123176874,5641347668,249947653938,
%T 11092958334732,494534011115264,22060105603804064,982920625501269624,
%U 43799276302849495414,1952019382459362360458,86999072734508636631708
%N Number of (n+1)X(3+1) arrays of permutations of 0..n*4+3 filled by rows with each element moved a city block distance of 0 or 2, and rows and columns in increasing lexicographic order.
%C Column 3 of A263602.
%H R. H. Hardin, <a href="/A263600/b263600.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=3
%e ..0..4..5..6....0..1..2.11....0..1..2..3....2..3..5..6....0..4..7.11
%e ..1..2..3..7....4..7..6.15...12..5..9.10....4..0..1.10....9..8..1.15
%e ..8.11.15.14....5..9..8..3...13..4..7.11....8.12..7.11...10..6..2..3
%e ..9.10.12.13...14.10.12.13...14..8..6.15....9.13.14.15...14..5.12.13
%Y Cf. A263602.
%K nonn
%O 1,1
%A _R. H. Hardin_, Oct 22 2015
| 