Search: id:A129553
Results 1-1 of 1 results found.
%I A129553
%S A129553 0,0,0,0,0,0,0,8,44,528,5976,77896,1052884,13666360
%N 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.
%H A129553 R. D. Chatham, The N+k Queens Problem Page.
%H A129553 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.
%e A129553 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.
%Y A129553 Cf. A000170, A129554.
%Y A129553 Sequence in context: A112908 A001689 A028565 this_sequence A075863 A118838
A153828
%Y A129553 Adjacent sequences: A129550 A129551 A129552 this_sequence A129554 A129555
A129556
%K A129553 more,nonn
%O A129553 1,8
%A A129553 R. Douglas Chatham (d.chatham(AT)moreheadstate.edu), Apr 20 2007
Search completed in 0.001 seconds