login
Consider the problem of placing N queens on an n X n board so that each queen attacks precisely k others. Here k=3 and sequence gives number of different solutions when N takes its maximal value.
2

%I #7 Mar 28 2015 11:49:46

%S 2,4,31,307,2,9,755,39302

%N Consider the problem of placing N queens on an n X n board so that each queen attacks precisely k others. Here k=3 and sequence gives number of different solutions when N takes its maximal value.

%C I would also like to get the sequences that gives the maximal values of N.

%D M. Gardner, The Last Recreations, Springer, 1997, p. 282.

%Y Cf. A051567-A051571, A051754-A051759, A019654.

%K nonn,nice,more

%O 3,1

%A _N. J. A. Sloane_

%E I am not certain this description is correct, nor how rigorous the results are.