|
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)
|
|
|
Search completed in 0.002 seconds
|
