login
A051571
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.
12
0, 0, 0, 1, 3, 40, 615, 16573
OFFSET
3,5
REFERENCES
M. Gardner, The Last Recreations, Springer, 1997, p. 282.
CROSSREFS
KEYWORD
nonn,more
EXTENSIONS
Probably an incorrect version of A019654.
STATUS
approved