|
| |
|
|
A103315
|
|
Sequence A006075 gives minimal number of knights needed to cover an n X n board. This sequence gives total number of solutions using A006075(n) knights (compare A006076).
|
|
4
| |
|
|
1, 1, 8, 9, 47, 127, 10, 2, 2, 4, 800, 2, 152, 4, 504, 2, 212, 19562
(list; graph; refs; listen; history; internal format)
|
| |
| |
|
|
