|
|
A263508
|
|
Number of (2+1) X (n+1) arrays of permutations of 0..n*3+2 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
|
|
|
59, 2282, 54924, 1111442, 20380008, 337841109, 5207863310, 75977562458, 1061547321219, 14333939101168, 188384704889515, 2422837596982624, 30621846746565687, 381598737516945031, 4701011865361444793
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=3
..0..4..7.11....1..2.10.11....0..1..3..6....0..1..6..7....0..2..3..7
..1..5..3..2....5..0..4..3....4.10..7.11....4.10.11..5....4..5.11..6
..9..8..6.10....9..8..7..6....5..8..2..9....8..9..2..3...10..1..8..9
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|