|
|
A263515
|
|
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 1, and rows and columns in increasing lexicographic order.
|
|
1
|
|
|
29, 660, 18369, 489294, 13332096, 362159570, 9866744449, 268827612021, 7327820172316, 199763751307958, 5446244243395198, 148487857544502671, 4048490973231712506, 110382192841761372934, 3009586412715099906678
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=3
..0..1..2..3..4....0..1..2..3..4....0..1..2..8..9....0..1..2..3..9
..5..6..7..8..9....6..5..7..9..8....5..6..7..3..4....6..5.12.13..4
.10.11.17.14.13...10.11.17.12.19...10.12.11.13.14...10.16..7..8.14
.15.16.12.18.19...15.16.18.13.14...15.16.17.18.19...15.11.17.18.19
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|