A331422 - cp's OEIS frontend

A331422 Triangle T(n, k) of the number of connected graphs of order n with cutting number k >= 0.

n	a(n)
1	1
2	1
3	1
4	1
5	3
6	0
7	2
8	1
9	10
10	0
11	0
12	5
13	3
14	2
15	1
16	56
17	0
18	0
19	0
20	29
21	0
22	13
23	8
24	3
25	2
26	1
27	468
28	0
29	0
30	0
31	0
32	219
33	0
34	0
35	63
36	69
37	0
38	16
39	12
40	3
41	2
42	1
43	7123
44	0
45	0
46	0
47	0
48	0
49	2706
50	0
51	0
52	0
53	502
54	263
55	300
56	0
57	85
58	80
59	24
60	16
61	12
62	3
63	2
64	1
65	194066
66	0
67	0
68	0
69	0
70	0
71	0
72	52879
73	0
74	0
75	0
76	0
77	6191
78	3197
79	0
80	2148
81	861
82	632
83	319
84	352
85	132
86	160
87	80
88	24
89	21
90	12
91	3
92	2
93	1

[1, 1, 1, 1, 3, 0, 2, 1, 10, 0, 0, 5, 3, 2, 1, 56, 0, 0, 0, 29, 0, 13, 8, 3, 2, 1, 468, 0, 0, 0, 0, 219, 0, 0, 63, 69, 0, 16, 12, 3, 2, 1, 7123, 0, 0, 0, 0, 0, 2706, 0, 0, 0, 502, 263, 300, 0, 85, 80, 24, 16, 12, 3, 2, 1, 194066, 0, 0, 0, 0, 0, 0, 52879, 0, 0, 0, 0, 6191, 3197, 0, 2148, 861, 632, 319, 352, 132, 160, 80, 24, 21, 12, 3, 2, 1]

cp's OEIS Frontend

A331422 Triangle T(n, k) of the number of connected graphs of order n with cutting number k >= 0.

Table of values

List of values