login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A373393
Number of minimum connected dominating sets in the n-triangular grid graph.
2
1, 3, 3, 11, 32, 48, 16, 48, 15072, 9552, 192, 333216, 134880, 6570096, 768, 9748704, 70272
OFFSET
0,2
COMMENTS
The connected domination number is A379353(n).
LINKS
Eric Weisstein's World of Mathematics, Connected Dominating Set.
Eric Weisstein's World of Mathematics, Triangular Grid Graph.
EXAMPLE
One of 16 arrangements for a(6) with 10 vertices:
o
o X
o X o
o o X o
o X X o o
X X o X X o
o o o o o X o
CROSSREFS
Sequence in context: A322701 A124265 A163938 * A109937 A054101 A376024
KEYWORD
nonn,more,changed
AUTHOR
Eric W. Weisstein, Jun 03 2024
EXTENSIONS
a(7)-a(16) from Andrew Howroyd, Dec 25 2024
STATUS
approved