A373395 Number of minimum connected dominating sets in the n-triangular graph.

1, 3, 12, 80, 750, 9072, 134456, 2359296, 47829690, 1100000000, 28295372292, 804925734912, 25090245516518, 850408685629440, 31139121093750000, 1224979098644774912, 51523614927176684274, 2307351090835290783744, 109607737155696043718780, 5505024000000000000000000

Offset

2,2

Comments

For n > 2, the connected domination number of the n-triangular graph is n-2.

Links

Table of n, a(n) for n=2..21.

Eric Weisstein's World of Mathematics, Connected Dominating Set.

Eric Weisstein's World of Mathematics, Triangular Graph.

Formula

a(2) = 1, a(n) = n*(n - 1)^(n - 3). - Detlef Meya, Jun 20 2024

Mathematica

a[2] := 1; a[n_] := n*(n - 1)^(n - 3); Table[a[n], {n, 2, 19}] (* Detlef Meya, Jun 20 2024 *)

Crossrefs

Sequence in context: A023879 A084565 A323634 * A275488 A304561 A303227

Adjacent sequences: A373392 A373393 A373394 * A373396 A373397 A373398

Keyword

nonn

Author

Eric W. Weisstein, Jun 03 2024

Extensions

a(9) and beyond from Detlef Meya, Jun 20 2024

Status

approved