A347535 Number of minimum dominating sets in the complete bipartite graph K_n,n.

2, 6, 9, 16, 25, 36, 49, 64, 81, 100, 121, 144, 169, 196, 225, 256, 289, 324, 361, 400, 441, 484, 529, 576, 625, 676, 729, 784, 841, 900, 961, 1024, 1089, 1156, 1225, 1296, 1369, 1444, 1521, 1600, 1681, 1764, 1849, 1936, 2025, 2116, 2209, 2304, 2401, 2500

Offset

1,1

Links

Table of n, a(n) for n=1..50.

Eric Weisstein's World of Mathematics, Complete Bipartite Graph

Eric Weisstein's World of Mathematics, Minimum Dominating Set

Index entries for linear recurrences with constant coefficients, signature (3, -3, 1).

Formula

a(n) = A000290(n) = n^2 for n > 2.

G.f.: x*(-2 + 3*x^2 - 5*x^3 + 2*x^4)/(-1 + x)^3.

Crossrefs

Cf. A000290.

Sequence in context: A172433 A049622 A043548 * A354975 A280228 A254057

Adjacent sequences: A347532 A347533 A347534 * A347536 A347537 A347538

Keyword

nonn,easy

Author

Eric W. Weisstein, Sep 05 2021

Status

approved