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 #7 May 03 2021 20:13:26
%S 0,1,9,784
%N Number of minimum total dominating sets in the n-transposition graph.
%C a(n) matches all 4 terms of the finite sequence A168257(n).
%C a(n) matches A060545(n-1)^2 for n=2 to 4.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/TotalDominatingSet.html">Total Dominating Set</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/TranspositionGraph.html">Transposition Graph</a>
%Y Cf. A303150 (set size), A321618, A303146.
%K nonn,more
%O 1,3
%A _Eric W. Weisstein_, Apr 19 2018