|
Search: id:A063724
|
|
|
| A063724 |
|
Consider problem of placing N queens on an n X n board so that each queen attacks precisely 4 others. Sequence gives maximal number of queens. |
|
+0
1
|
|
| 0, 0, 0, 8, 11, 15, 18, 21, 24, 27, 30, 33, 36, 39, 42, 45, 48, 51, 54, 57, 60, 63, 66, 69, 72, 75, 78, 81, 84, 87, 90, 93, 96, 99, 102, 105, 108, 111, 114, 117, 120, 123, 126, 129, 132, 135, 138, 141, 144, 147, 150, 153, 156, 159, 162, 165, 168, 171, 174, 177, 180
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
REFERENCES
|
Peter Hayes, A Problem of Chess Queens, Journal of Recreational Mathematics, 24(4), 1992, 264-271.
|
|
EXAMPLE
|
a(1)=a(2)=a(3)=0,a4(8),a(5)=11, a(n)=3n-3 for n >= 6.
|
|
CROSSREFS
|
Cf. A051754-A051759, A051567-A051571.
Sequence in context: A028394 A078117 A032423 this_sequence A167499 A154685 A068591
Adjacent sequences: A063721 A063722 A063723 this_sequence A063725 A063726 A063727
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jud McCranie (j.mccranie(AT)comcast.net), Aug 11 2001
|
|
|
Search completed in 0.002 seconds
|
