|
|
A251529
|
|
Number of ways to place any number of black and any number of white nonattacking knights on a (n+2)X(4+2) board
|
|
1
|
|
|
3222565, 216137483, 17145057973, 1212903660581, 85453027245665, 6219630222384685, 454299179677008977, 33096333812202713141, 2417309215420079989015, 176914291529572534071801
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=1
..0..0..2..0..0..0....0..0..0..2..0..0....0..0..0..0..1..2....0..0..1..0..1..1
..0..0..0..1..0..1....0..2..0..1..2..0....0..0..0..2..2..0....0..1..1..0..0..0
..0..0..0..0..1..0....0..0..2..2..0..1....0..0..0..0..2..0....0..0..2..1..0..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|