A325111 - cp's OEIS frontend

A325111 Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes with k articulation vertices, (0 <= k <= n).

n	a(n)
0	1
1	1
2	0
3	1
4	0
5	0
6	1
7	1
8	0
9	0
10	3
11	2
12	1
13	0
14	0
15	10
16	7
17	3
18	1
19	0
20	0
21	56
22	33
23	17
24	5
25	1
26	0
27	0
28	468
29	244
30	101
31	32
32	7
33	1
34	0
35	0
36	7123
37	2792
38	890
39	242
40	60
41	9
42	1
43	0
44	0
45	194066
46	52448
47	11468
48	2461
49	527
50	97
51	12
52	1
53	0
54	0
55	9743542
56	1690206
57	239728
58	35839
59	6056
60	1029
61	155
62	15
63	1
64	0
65	0

[1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 3, 2, 1, 0, 0, 10, 7, 3, 1, 0, 0, 56, 33, 17, 5, 1, 0, 0, 468, 244, 101, 32, 7, 1, 0, 0, 7123, 2792, 890, 242, 60, 9, 1, 0, 0, 194066, 52448, 11468, 2461, 527, 97, 12, 1, 0, 0, 9743542, 1690206, 239728, 35839, 6056, 1029, 155, 15, 1, 0, 0]

cp's OEIS Frontend

A325111 Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes with k articulation vertices, (0 <= k <= n).

Table of values

List of values