|
|
A263545
|
|
T(n,k)=Number of (n+2)X(k+2) arrays of permutations of 0..(n+2)*(k+2)-1 with each element moved 0 or 1 knight moves and no more than 3 elements left unmoved.
|
|
2
|
|
|
20, 124, 124, 884, 3328, 884, 2960, 32284, 32284, 2960, 43808, 692605, 1704784, 692605, 43808, 128576, 12621312, 26361664, 26361664, 12621312, 128576, 1845824, 200111881, 6446653792
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Table starts
.....20......124......884.....2960......43808....128576.1845824
....124.....3328....32284...692605...12621312.200111881
....884....32284..1704784.26361664.6446653792
...2960...692605.26361664
..43808.12621312
.128576
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=2 k=4
..0.12.13..7..8.16....0.12..6.11.17.16....0.12.15..7..8.16....0.12.10..3.17.16
.19..3..4.17.23.22...19..3..8.20..2.22...19.18.21..1.23..3...14.20.19..5..2.22
.20..2..1.11..5.21....1.21.18.23..5..4...20..2.22..4..5.17....1.21.18.23..8..4
.18..6..9.10.14.15...14.15..7.13..9.10...14..6..9.13.11.10....7..6..9.13.11.15
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|