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.
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.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =3a(4) =8a(5) =23a(6) =3a(7) =1a(8) =1a(9) =2a(10) =100a(11) =1a(12) =20a(13) =1a(14) =63a(15) =1a(16) =29a(17) =2551
External references
- oeis: A006076