|
Search: id:A019654
|
|
|
| A019654 |
|
Consider problem of placing N queens on an n X n board so that each queen attacks precisely k others. Here k=4 and sequence gives number of different solutions when N takes its maximal value. |
|
+0
13
|
| |
|
|
OFFSET
|
3,5
|
|
|
COMMENT
|
I would also like to get the sequences that give the maximal value of N.
|
|
REFERENCES
|
M. Gardner, The Colossal Book of Mathematics, 2001, p. 209.
|
|
CROSSREFS
|
Cf. A051567-A051571, A051754-A051759.
Sequence in context: A005724 A093376 A051571 this_sequence A156356 A143640 A047799
Adjacent sequences: A019651 A019652 A019653 this_sequence A019655 A019656 A019657
|
|
KEYWORD
|
nonn,nice,more
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Oct 03, 2002
|
|
EXTENSIONS
|
I am not certain this description is correct, nor how rigorous the results are.
|
|
|
Search completed in 0.002 seconds
|
