VOOZH
about
URL: https://oeis.org/A129553
⇱ A129553 - OEIS
login
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
;
text
;
internal format
)
OFFSET
1,8
LINKS
Table of n, a(n) for n=1..14.
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
, J. Combin. Math. Combin. Comput. 68 (2009), 3-17.
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:
A350128
A028565
A366338
*
A174643
A181268
A374281
Adjacent sequences:
A129550
A129551
A129552
*
A129554
A129555
A129556
KEYWORD
more
,
nonn
AUTHOR
R. Douglas Chatham (d.chatham(AT)moreheadstate.edu), Apr 20 2007
STATUS
approved