A294217 - cp's OEIS frontend

A294217 Triangle read by rows: T(n,k) is the number of graphs with n vertices and minimum vertex degree k, (0 <= k < n).

n	a(n)
1	1
2	1
3	1
4	2
5	1
6	1
7	4
8	4
9	2
10	1
11	11
12	12
13	8
14	2
15	1
16	34
17	60
18	43
19	15
20	3
21	1
22	156
23	378
24	360
25	121
26	25
27	3
28	1
29	1044
30	3843
31	4869
32	2166
33	378
34	41
35	4
36	1
37	12346
38	64455
39	113622
40	68774
41	14306
42	1095
43	65
44	4
45	1
46	274668
47	1921532
48	4605833
49	3953162
50	1141597
51	104829
52	3441
53	100
54	5
55	1

[1, 1, 1, 2, 1, 1, 4, 4, 2, 1, 11, 12, 8, 2, 1, 34, 60, 43, 15, 3, 1, 156, 378, 360, 121, 25, 3, 1, 1044, 3843, 4869, 2166, 378, 41, 4, 1, 12346, 64455, 113622, 68774, 14306, 1095, 65, 4, 1, 274668, 1921532, 4605833, 3953162, 1141597, 104829, 3441, 100, 5, 1]

cp's OEIS Frontend

A294217 Triangle read by rows: T(n,k) is the number of graphs with n vertices and minimum vertex degree k, (0 <= k < n).

Table of values

List of values