|
|
A251530
|
|
Number of ways to place any number of black and any number of white nonattacking knights on a (n+2) X (5+2) board.
|
|
1
|
|
|
31361437, 4060878845, 629694824303, 85453027245665, 11726484486571601, 1671396405843418205, 239415740786170785059, 34268623489221568471683, 4926792732223129880488261, 710174571545415147604020125
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=1
..0..0..0..1..1..0..0....0..0..0..0..0..0..2....0..0..0..0..0..0..2
..0..0..0..0..0..0..1....0..0..0..2..2..2..1....0..0..0..1..0..0..2
..0..0..0..0..1..0..0....0..0..0..2..1..0..0....0..0..2..2..2..0..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|