|
Search: id:A051754
|
|
|
| A051754 |
|
Consider problem of placing N queens on an n X n board so that each queen attacks precisely 1 other. Sequence gives maximal number of queens. |
|
+0
13
|
| |
|
|
OFFSET
|
2,1
|
|
|
COMMENT
|
2*[2n/3] is an upper bound for a(n), which is achieved for n=2, 4, and 6-14. - Jud McCranie (j.mccranie(AT)comcast.net), Aug 12 2001
|
|
REFERENCES
|
Martin Gardner, The Last Recreations, Copernicus, NY, 1997, 274-283.
|
|
CROSSREFS
|
Cf. A051755-A051759, A051567-A051571, A019654.
Adjacent sequences: A051751 A051752 A051753 this_sequence A051755 A051756 A051757
Sequence in context: A120541 A059867 A046971 this_sequence A108747 A116931 A034397
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
Robert Trent (trentrd(AT)hotmail.com), Aug 23 2000
|
|
|
Search completed in 0.002 seconds
|
