login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A279407 Domination number for knights' graph on an n X n toroidal board. 1
1, 2, 3, 4, 5, 6, 9, 8 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

That is, the minimal number of knights needed to cover an n X n toroidal chessboard so that every square either has a knight on it, or is under attack by a knight, or both.

REFERENCES

John J. Watkins, Across the Board: The Mathematics of Chessboard Problem, Princeton University Press, 2004, pages 140-144.

LINKS

Table of n, a(n) for n=1..8.

EXAMPLE

For an 8 X 8 board, the solution is:

N......N

........

..N..N..

........

...NN...

........

.N....N.

........

CROSSREFS

Cf. A006075, A279402.

Sequence in context: A270194 A055170 A068384 * A222253 A269838 A246376

Adjacent sequences:  A279404 A279405 A279406 * A279408 A279409 A279410

KEYWORD

nonn,hard,more

AUTHOR

Andrey Zabolotskiy, Dec 12 2016

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 26 10:18 EDT 2019. Contains 321491 sequences. (Running on oeis4.)