|
|
A263505
|
|
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 1 or 2, and rows and columns in increasing lexicographic order.
|
|
1
|
|
|
204, 54924, 8349744, 1425379543, 255768846517, 45106218220800, 7926850731406310, 1396923001460796082, 246241734024212430336, 43395678521748623480782, 7648012844415558576096743
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=2
..0..4..7.11....0..5..6.11....0..1..3.11....0..3.10.11....0..2..3.11
..8..6..1..2....1..8..9..7....5..4..6..2....1..5..2..7....1..4..9..6
..9.10..5..3...10..4..2..3....8..9.10..7....4..6..8..9....8.10..5..7
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|