cp's OEIS Frontend

A286958 Triangle read by rows: T(n,k) is the number of graphs with n vertices with connected domination number k.

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