|
Search: id:A051570
|
|
|
| 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. |
|
+0
2
|
| |
|
|
OFFSET
|
3,1
|
|
|
COMMENT
|
I would also like to get the sequences that give the maximal values of N.
|
|
REFERENCES
|
M. Gardner, The Last Recreations, Springer, 1997, p. 282.
|
|
CROSSREFS
|
Cf. A051567-A051571, A051754-A051759, A019654.
Sequence in context: A051569 A087186 A051759 this_sequence A082913 A083205 A019542
Adjacent sequences: A051567 A051568 A051569 this_sequence A051571 A051572 A051573
|
|
KEYWORD
|
nonn,nice,more
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
I am not certain this description is correct, nor how rigorous the results are.
|
|
|
Search completed in 0.002 seconds
|
