A350060 - cp's OEIS frontend

A350060 Triangle read by rows: T(n,k) is the number of labeled threshold graphs on vertex set [n] in which k dominating vertices are added in standard iterative construction, n >= 1 and 0 <= k <= n-1.

n	a(n)
1	1
2	1
3	1
4	1
5	6
6	1
7	1
8	22
9	22
10	1
11	1
12	65
13	200
14	65
15	1
16	1
17	171
18	1265
19	1265
20	171
21	1
22	1
23	420
24	6566
25	15050
26	6566
27	420
28	1
29	1
30	988
31	30156
32	136346
33	136346
34	30156
35	988
36	1
37	1
38	2259
39	127632
40	1039878
41	2009952
42	1039878
43	127632
44	2259
45	1

[1, 1, 1, 1, 6, 1, 1, 22, 22, 1, 1, 65, 200, 65, 1, 1, 171, 1265, 1265, 171, 1, 1, 420, 6566, 15050, 6566, 420, 1, 1, 988, 30156, 136346, 136346, 30156, 988, 1, 1, 2259, 127632, 1039878, 2009952, 1039878, 127632, 2259, 1]

cp's OEIS Frontend

A350060 Triangle read by rows: T(n,k) is the number of labeled threshold graphs on vertex set [n] in which k dominating vertices are added in standard iterative construction, n >= 1 and 0 <= k <= n-1.

Table of values

List of values