cp's OEIS Frontend

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.

Showing 1-1 of 1 results.

A370428 Connected domination number of the n X n king graph.

Original entry on oeis.org

1, 1, 1, 4, 5, 8, 12, 15, 20, 24, 28, 33, 39, 46, 52, 58
Offset: 1

Views

Author

Alexander D. Healy, Feb 24 2024

Keywords

Comments

In other words, a(n) is the minimum number of kings that can be placed on an n X n chessboard such that (i) the occupied squares form a single connected component, and (ii) every square is either occupied by a king or adjacent to one that is.
a(17) <= 67; a(18) <= 75; a(19) <= 83; a(20) <= 92.

Links

Crossrefs

Cf. A075561, A289180, A302401, A369692.
Cf. A382206 (numbers of minimum connected dominating sets).

Extensions

a(13)-a(16) from Andrew Howroyd, Feb 25 2024
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.