Number of minimum connected dominating sets in the n-triangular grid graph.
A373393
Number of minimum connected dominating sets in the n-triangular grid graph.
Terms
- a(0) =1a(1) =3a(2) =3a(3) =11a(4) =32a(5) =48a(6) =16a(7) =48a(8) =15072a(9) =9552a(10) =192a(11) =333216a(12) =134880a(13) =6570096a(14) =768a(15) =9748704a(16) =70272
External references
- oeis: A373393