|
Search: id:A051755
|
|
|
| A051755 |
|
Consider problem of placing N queens on an n X n board so that each queen attacks precisely 2 others. Sequence gives maximal number of queens. |
|
+0
4
|
|
| 3, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108, 110, 112, 114, 116, 118, 120, 122, 124, 126, 128, 130
(list; graph; listen)
|
|
|
OFFSET
|
2,1
|
|
|
REFERENCES
|
Peter Hayes, A Problem of Chess Queens, Journal of Recreational Mathematics, 24(4), 1992, 264-271.
|
|
FORMULA
|
a(2)=3, a(n)=2n-2 for n >= 3.
|
|
CROSSREFS
|
Cf. A051754-A051759, A051567-A051571, A019654.
Sequence in context: A024511 A024705 A058992 this_sequence A092535 A135667 A156624
Adjacent sequences: A051752 A051753 A051754 this_sequence A051756 A051757 A051758
|
|
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 11 2001
|
|
|
Search completed in 0.002 seconds
|
