close
login
A303141
Number of minimum total dominating sets in the n X n black bishop graph.
6
0, 1, 4, 1, 2, 61, 9, 104, 2586, 270, 5460, 184710, 12600, 458640, 20113380, 982800, 53373600, 3042295200, 109544400, 8497742400, 611967862800, 16922228400, 1762112167200, 157184659447200, 3432645216000, 463679536320000, 50284574580240000, 888196949640000, 150857156385936000, 19562163412303512000
OFFSET
1,3
COMMENTS
For n >= 3, the total domination number is given by floor(2*n/3) = A004523(n). - Andrew Howroyd, May 17 2025
LINKS
Eric Weisstein's World of Mathematics, Black Bishop Graph.
Eric Weisstein's World of Mathematics, Minimum Total Dominating Set.
PROG
(PARI) vector(30, n, A303141(n)) \\ See PARI link in A321673 for program code. - Andrew Howroyd, May 17 2025
CROSSREFS
Cf. A303144 (white bishop).
Sequence in context: A159766 A280284 A004161 * A246070 A202778 A025016
KEYWORD
nonn
AUTHOR
Eric W. Weisstein, Apr 19 2018
EXTENSIONS
a(8)-a(10) from Andrew Howroyd, Apr 20 2018
a(11) from Eric W. Weisstein, Apr 02 2025
a(12) onwards from Andrew Howroyd, May 16 2025
STATUS
approved