|
| |
|
|
A129553
|
|
Number of ways to place n+3 queens and 3 pawns on an n X n board so that no two queens attack each other.
|
|
1
| |
|
|
0, 0, 0, 0, 0, 0, 0, 8, 44, 528, 5976, 77896, 1052884, 13666360
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,8
|
|
|
LINKS
| R. D. Chatham, The N+k Queens Problem Page.
R. D. Chatham, M. Doyle, G. H. Fricke, J. Reitmann, R. D. Skaggs and M. Wolff, Independence and Domination Separation in Chessboard Graphs, Journal of Combinatorial Mathematics and Combinatorial Computing, to appear.
|
|
|
EXAMPLE
| a(4)=0 because when 7 queens are placed on a 4 X 4 board, at least two queens will be adjacent and therefore mutually attacking.
|
|
|
CROSSREFS
| Cf. A000170, A129554.
Sequence in context: A126476 A112908 A028565 * A174643 A181268 A075863
Adjacent sequences: A129550 A129551 A129552 * A129554 A129555 A129556
|
|
|
KEYWORD
| more,nonn
|
|
|
AUTHOR
| R. Douglas Chatham (d.chatham(AT)moreheadstate.edu), Apr 20 2007
|
| |
|
|
