|
|
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.
|
|
13
|
|
|
|
OFFSET
|
3,5
|
|
COMMENTS
|
I would also like to get the sequences that give the maximal value of N.
Values for a(9) onwards currently unverified. - Sean A. Irvine, Apr 05 2019
|
|
REFERENCES
|
M. Gardner, The Last Recreations, Springer, 1997, p. 282.
M. Gardner, The Colossal Book of Mathematics, 2001, p. 209.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Queens Problem [From Claudio (lordofchaos000(AT)hotmail.com), May 31 2010]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,nice,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
I am not certain this description is correct, nor how rigorous the results are.
a(4) and a(5) changed to 1 and irrelevant comment removed by Sean A. Irvine, Apr 02 2019
|
|
STATUS
|
approved
|
|
|
|