|
Search: id:A051757
|
|
|
| A051757 |
|
Consider problem of placing A051754(n) queens on an n X n board so that each queen attacks precisely 1 other. Sequence gives number of solutions up to square symmetry. |
|
+0
2
|
| |
|
|
OFFSET
|
2,1
|
|
|
COMMENT
|
When n is a multiple of 3, the bound of 2[2n/3] queens is so tight that in solutions with that number of queens, all attacks must be along rows or columns, making solutions rare. - Jud McCranie
|
|
REFERENCES
|
Martin Gardner, The Last Recreations, Copernicus, 1997, 274-283.
|
|
CROSSREFS
|
Cf. A051754-A051759, A051567-A051571, A019654.
Sequence in context: A100759 A152555 A094360 this_sequence A070524 A021366 A135155
Adjacent sequences: A051754 A051755 A051756 this_sequence A051758 A051759 A051760
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
Robert Trent (trentrd(AT)hotmail.com), Aug 23 2000
|
|
EXTENSIONS
|
More terms from Jud McCranie (j.mccranie(AT)comcast.net), Aug 14 2001
|
|
|
Search completed in 0.002 seconds
|
