|
|
A263605
|
|
Number of (3+1)X(n+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.
|
|
1
|
|
|
24, 1962, 69792, 1880912, 51961032, 1372902790, 33884598625, 807142134398, 18779339172610, 428729281937316, 9643905774436924, 214695476497108228, 4743560856622740097, 104225642166723506952, 2280739348249274754822
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=3
..0..1..7.11....0..1..2..3....0..6..7.11....0..4..7.11....0..1..2..3
..4..5..6..2....4..5.11..7....1.10..9..2....9..8..1.15....4.10..9.15
..8..9.15..3....8..6.15.14....5..4..8..3...10..6..2..3....8.11..5..6
.14.10.12.13...12.10..9.13...12.13.14.15...12..5.14.13...12.13.14..7
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|