|
|
A051570
|
|
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
|
|
|
|
OFFSET
|
3,1
|
|
COMMENTS
|
I would also like to get the sequences that gives the maximal values of N.
|
|
REFERENCES
|
M. Gardner, The Last Recreations, Springer, 1997, p. 282.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,nice,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
I am not certain this description is correct, nor how rigorous the results are.
|
|
STATUS
|
approved
|
|
|
|