This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A103315 #41 Jul 09 2025 04:24:32 %S A103315 1,1,8,9,47,127,10,2,2,4,800,2,152,4,504,2,212,19562 %N A103315 Number of minimum dominating sets for the n X n knight graph. %C A103315 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). %H A103315 Lee Morgenstern, <a href="https://web.archive.org/web/20070102070601/http://home.earthlink.net/~morgenstern/">Knight Domination</a>. %H A103315 Frank Rubin, <a href="http://www.contestcen.com/knight.htm">Knight coverings for large chessboards</a>, 2000. %H A103315 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/KnightGraph.html">Knight Graph</a> %H A103315 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MinimumDominatingSet.html">Minimum Dominating Set</a> %Y A103315 Cf. A006075 (domination number of the n X n knight graph). %Y A103315 Cf. A006076 (inequivalent number of minimum dominating sets). %Y A103315 Cf. A098604. %K A103315 nonn,more %O A103315 1,3 %A A103315 _N. J. A. Sloane_, Mar 20 2005, following a suggestion from Lee Morgenstern %E A103315 New name from _Eric W. Weisstein_, Sep 06 2021