The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A279404 Independent domination number for queens' graph on an n X n toroidal board. 4

%I #9 Dec 15 2016 23:48:36

%S 1,1,1,2,5,4,5,4,5,5,5,6,7,7,5,8

%N Independent domination number for queens' graph on an n X n toroidal board.

%C 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 A279402(n) <= a(n) <= A085801(n).

%H Christina M. Mynhardt, <a href="http://pldml.icm.edu.pl/pldml/element/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1193/c/dmgt.1193.pdf">Upper bounds for the domination numbers of toroidal queens graphs</a>, Discussiones Mathematicae Graph Theory, 23 (2003), 163-175, DOI:10.7151/dmgt.1193.

%F a(3*n) = n if n = 1, 5, 7, 11 (mod 12).

%Y Cf. A075324, A085801, A279402.

%K nonn,hard,more

%O 1,4

%A _Andrey Zabolotskiy_, Dec 11 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 3 19:10 EST 2023. Contains 367540 sequences. (Running on oeis4.)