A286958 - 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.

n	a(n)
1	1
2	1
3	2
4	4
5	2
6	11
7	8
8	2
9	34
10	62
11	14
12	2
13	156
14	514
15	163
16	18
17	2
18	1044
19	7147
20	2583
21	317
22	24
23	2
24	12346
25	170803
26	70667
27	6720
28	513
29	29
30	2
31	274668
32	7613603
33	3566498
34	247454
35	13525
36	785
37	36
38	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]

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.

Table of values

List of values