A321673 Number of minimum total dominating sets in the n X n bishop graph.

0, 1, 16, 1, 8, 3721, 108, 10816, 6568440, 72900, 31449600, 34117784100, 165564000, 210350649600, 402994899820800, 965895840000, 2867571383040000, 9255560083943040000, 12074509581120000, 72211625896757760000, 373919369489319044160000, 286361814021766560000, 3107808843778161008640000

Offset

1,3

Links

Andrew Howroyd, Table of n, a(n) for n = 1..200

Andrew Howroyd, PARI Program, May 2025.

Eric Weisstein's World of Mathematics, Bishop Graph.

Eric Weisstein's World of Mathematics, Minimum Total Dominating Set.

Formula

a(n) = A303141(n) * A303144(n). - Andrew Howroyd, Nov 16 2018

Prog

(PARI) vector(24, n, A321673(n)) \\ See PARI link. - Andrew Howroyd, May 17 2025

Crossrefs

Cf. A303141 (black bishop graph).

Cf. A303144 (white bishop graph).

Cf. A304555, A304564, A321674.

Sequence in context: A040267 A363917 A040268 * A040269 A360028 A141682

Adjacent sequences: A321670 A321671 A321672 * A321674 A321675 A321676

Keyword

nonn

Author

Eric W. Weisstein, Nov 16 2018

Extensions

a(8)-a(10) from Andrew Howroyd, Nov 16 2018

a(11) from Eric W. Weisstein, Apr 03 2025

a(12) onwards from Andrew Howroyd, May 16 2025

Status

approved