

A286958


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


2



1, 1, 2, 4, 2, 11, 8, 2, 34, 62, 14, 2, 156, 514, 163, 18, 2, 1044, 7147, 2583, 317, 24, 2, 12346, 170803, 70667, 6720, 513, 29, 2, 274668, 7613603, 3566498, 247454, 13525, 785, 36, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,3


LINKS



EXAMPLE

Triangle begins:
1;
1;
2;
4, 2;
11, 8, 2;
34, 62, 14, 2;
156, 514, 163, 18, 2;
...


CROSSREFS



KEYWORD

nonn,tabf,more


AUTHOR



STATUS

approved



