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”).
%I #9 Dec 01 2024 18:47:07
%S 0,0,0,2,13,104,876,11680,271063,11977655
%N Number of dominating nonunique simple graphs on n nodes.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/DominationPolynomial.html">Domination Polynomial</a>.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/DominatingUniqueGraph.html">Dominating Unique Graph</a>.
%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/SimpleGraph.html">Simple Graph</a>.
%F a(n) = A000088(n) - A378516(n).
%Y Cf. A378516 (number of dominating unique graphs).
%Y Cf. A000088 (number of simple graphs).
%K nonn,more,new
%O 1,4
%A _Eric W. Weisstein_, Nov 29 2024