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 A279404 #18 Mar 12 2024 22:52:01 %S A279404 1,1,1,2,5,4,5,4,5,5,5,6,7,7,5,8,9,10 %N A279404 Independent domination number for queens' graph on an n X n toroidal board. %C A279404 That is, the minimal number of queens needed to cover an n X n toroidal chessboard so that every square either has a queen on it or is under attack by a queen, but not both. %C A279404 A279402(n) <= a(n) <= A085801(n). %H A279404 Andy Huchala, <a href="/A279404/a279404_1.py.txt">Python program</a>. %H A279404 Christina M. Mynhardt, <a href="https://doi.org/10.7151/dmgt.1193">Upper bounds for the domination numbers of toroidal queens graphs</a>, Discussiones Mathematicae Graph Theory, 23 (2003), 163-175. %F A279404 a(3*n) = n if n = 1, 5, 7, 11 (mod 12). %Y A279404 Cf. A075324, A085801, A279402. %K A279404 nonn,hard,more %O A279404 1,4 %A A279404 _Andrey Zabolotskiy_, Dec 11 2016 %E A279404 a(17)-a(18) from _Andy Huchala_, Mar 09 2024