|
%I #6 Mar 28 2015 11:50:11
%S 0,0,0,1,3,40,615,16573
%N Consider problem of placing N queens on an n X n board so that each queen attacks precisely k others. Here k=4 and sequence gives number of different solutions when N takes its maximal value.
%D M. Gardner, The Last Recreations, Springer, 1997, p. 282.
%Y Cf. A051567-A051570, A051754-A051759, A019654.
%K nonn,more
%O 3,5
%A _N. J. A. Sloane_
%E Probably an incorrect version of A019654.
|
