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”).

A347502
Number of dominating sets in the n-cycle complement graph.
0
0, -1, -1, 1, 9, 21, 51, 113, 239, 493, 1003, 2025, 4071, 8165, 16355, 32737, 65503, 131037, 262107, 524249, 1048535, 2097109, 4194259, 8388561, 16777167, 33554381, 67108811, 134217673, 268435399, 536870853, 1073741763, 2147483585, 4294967231, 8589934525
OFFSET
0,5
COMMENTS
Sequence extended to a(0) using the generating function.
LINKS
Eric Weisstein's World of Mathematics, Cycle Complement Graph
Eric Weisstein's World of Mathematics, Dominating Set
FORMULA
a(n) = A070313(n) = 2^n-2*n-1 for n != 4.
G.f.: x^3*(-1 - 5*x + 10*x^2 - 10*x^3 + 4*x^4)/((-1 + x)^2*(-1 + 2*x)).
E.g.f.: exp(2*x) + x^4/12 - exp(x)*(1 + 2*x). - Stefano Spezia, Sep 04 2021
CROSSREFS
Cf. A070313.
Sequence in context: A144482 A251212 A176896 * A134717 A216980 A372664
KEYWORD
sign,easy
AUTHOR
Eric W. Weisstein, Sep 04 2021
STATUS
approved