|
|
A251531
|
|
T(n,k)=Number of ways to place any number of black and any number of white nonattacking knights on a (n+2)X(k+2) board
|
|
7
|
|
|
3465, 30377, 30377, 318659, 546525, 318659, 3222565, 11314071, 11314071, 3222565, 31361437, 216137483, 463425639, 216137483, 31361437, 307927905, 4060878845, 17145057973, 17145057973, 4060878845, 307927905, 3055869419, 77906507591
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Table starts
......3465.......30377.........318659..........3222565............31361437
.....30377......546525.......11314071........216137483..........4060878845
....318659....11314071......463425639......17145057973........629694824303
...3222565...216137483....17145057973....1212903660581......85453027245665
..31361437..4060878845...629694824303...85453027245665...11726484486571601
.307927905.77906507591.23667617769817.6219630222384685.1671396405843418205
|
|
LINKS
|
|
|
FORMULA
|
Empirical for column k:
k=1: [linear recurrence of order 57]
|
|
EXAMPLE
|
Some solutions for n=1 k=4
..0..1..1..1..1..1....0..0..0..0..0..2....0..1..0..0..0..0....0..0..2..2..0..1
..0..0..0..1..1..1....0..0..2..2..2..2....0..0..1..1..0..1....0..2..2..0..0..2
..0..0..1..1..0..1....0..0..0..0..0..0....0..0..0..0..0..0....0..0..0..0..0..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|