|
|
A263601
|
|
Number of (n+1)X(4+1) arrays of permutations of 0..n*5+4 filled by rows with each element moved a city block distance of 0 or 2, and rows and columns in increasing lexicographic order.
|
|
1
|
|
|
27, 13455, 1880912, 248766606, 40226420700, 6430889476830, 997089350659935, 155066286980838574, 24289572000868063504, 3800307063007851818782, 594288727534365247459980, 92947011169275040045085134
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=2
..0..1..2..7..8....0..5..8..9.14....0..3..8.13.14....0..3..8.13.14
.11.10..3.14..9....1..2.11..6.13....1..2..7.12..9....5..2..9..4..7
.12..5..6.13..4...10..7.12..3..4....6..5.10.11..4...10..1..6.11.12
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|