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 #21 Feb 26 2024 16:19:23
%S 1,1,2,4,2,11,8,2,34,62,14,2,156,514,163,18,2,1044,7147,2583,317,24,2,
%T 12346,170803,70667,6720,513,29,2,274668,7613603,3566498,247454,13525,
%U 785,36,2
%N Triangle read by rows: T(n,k) is the number of graphs with n vertices with connected domination number k.
%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ConnectedDominationNumber.html">Connected Domination Number</a>.
%e Triangle begins:
%e 1;
%e 1;
%e 2;
%e 4, 2;
%e 11, 8, 2;
%e 34, 62, 14, 2;
%e 156, 514, 163, 18, 2;
%e ...
%Y Row sums are A001349.
%Y Column k=1 is A000088(n-1).
%Y Cf. A263284, A332400, A332401.
%K nonn,tabf,more
%O 1,3
%A _Eric W. Weisstein_, May 17 2017