A320579 - cp's OEIS frontend

A320579 Triangle read by rows: T(n,k) is the number of disconnected permutation graphs on n vertices with domination number k, with 2 <= k <= n.

n	a(n)
2	1
3	2
4	1
5	7
6	3
7	1
8	26
9	18
10	4
11	1
12	115
13	111
14	27
15	5
16	1
17	592
18	771
19	186
20	37
21	6
22	1
23	3532
24	5906
25	1459
26	274
27	48
28	7
29	1
30	24212
31	49982
32	12643
33	2253
34	378
35	60
36	8
37	1
38	188869
39	466314
40	120252
41	20228
42	3230
43	499
44	73
45	9
46	1

[1, 2, 1, 7, 3, 1, 26, 18, 4, 1, 115, 111, 27, 5, 1, 592, 771, 186, 37, 6, 1, 3532, 5906, 1459, 274, 48, 7, 1, 24212, 49982, 12643, 2253, 378, 60, 8, 1, 188869, 466314, 120252, 20228, 3230, 499, 73, 9, 1]

cp's OEIS Frontend

A320579 Triangle read by rows: T(n,k) is the number of disconnected permutation graphs on n vertices with domination number k, with 2 <= k <= n.

Table of values

List of values