proposed
approved
proposed
approved
editing
proposed
In other words, as made explicit in the old name: Sequence A006075 gives minimum number of knights needed to cover an n X n board (i.e., the domination number of the n X n knight graph). This sequence (A103315 ) gives total number of solutions using A006075(n) knights (compare A006076).
gives total number of solutions using A006075(n) knights (compare A006076).
Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/KnightGraph.html">Knight Graph</a>.
Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MinimumDominatingSet.html">Minimum Dominating Set</a>.
In other words, as made explicit in the old name: Sequence A006075 gives minimum number of knights needed to cover an n X n board (i.e., the domination number of the n X n knight graph). This sequence gives total number of solutions using A006075(n) knights (compare A006076A103315 ).
gives total number of solutions using A006075(n) knights (compare A006076).
approved
editing
reviewed
approved
proposed
reviewed
editing
proposed
editing
proposed