|
|
A251527
|
|
Number of ways to place any number of black and any number of white nonattacking knights on a (n+2)X(2+2) board
|
|
1
|
|
|
30377, 546525, 11314071, 216137483, 4060878845, 77906507591, 1498035497513, 28691083120021, 549693762159617, 10541959853810087, 202160251694906929, 3876276632392216321, 74329842782534694397, 1425379360351558502261
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=1
..2..0..0..2....0..2..0..0....2..1..0..1....2..1..0..0....1..0..0..0
..2..0..0..1....2..1..0..0....0..1..0..0....0..1..2..0....2..0..1..0
..1..0..0..1....2..0..2..0....0..2..0..1....0..0..1..1....0..1..2..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|