|
Search: id:A006076
|
|
|
| A006076 |
|
Sequence A006075 gives minimal number of knights needed to cover an n X n board. This sequence gives number of inequivalent solutions using A006075(n) knights.
(Formerly M0884)
|
|
+0
7
|
|
| 1, 1, 2, 3, 8, 23, 3, 1, 1, 2, 100, 1, 20, 1, 63, 1, 29, 2551
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
David C. Fisher, On the N X N Knight Cover Problem, Ars Combinatoria 69 (2003), 255-274.
M. Gardner, Mathematical Magic Show. Random House, NY, 1978, p. 194.
Bernard Lemaire, Knights Covers on N X N Chessboards, J.Recreational Mathematics, Vol. 31-2, pp. 87-99, 2003.
Frank Rubin, Improved knight coverings, Ars Combinatoria 69 (2003), 185-196.
|
|
LINKS
|
Lee Morgenstern, Knight Domination
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
CROSSREFS
|
Cf. A006075 (number of solutions), A098604 (rectangular board). A103315 gives the total number of solutions.
Sequence in context: A089402 A127940 A006796 this_sequence A086628 A032096 A120763
Adjacent sequences: A006073 A006074 A006075 this_sequence A006077 A006078 A006079
|
|
KEYWORD
|
nonn,hard,nice
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
a(11) was found 1n 1973 by Bernard Lemaire. (DELEHAM Philippe, Jan 06 2004)
a(13)-a(17) from the Morgenstern web site, Nov 08 2004
a(18) from the Morgenstern web site, Mar 20 2005
|
|
|
Search completed in 0.002 seconds
|
