A339071 - cp's OEIS frontend

A339071 Triangle read by rows: T(n,k) is the number of unlabeled simple nonseparable (or 2-connected) graphs with n nodes and k edges (n >= 1, n-1 <= k <= n*(n-1)/2).

n	a(n)
1	0
2	1
3	0
4	1
5	0
6	1
7	1
8	1
9	0
10	1
11	2
12	3
13	2
14	1
15	1
16	0
17	1
18	3
19	9
20	14
21	12
22	8
23	5
24	2
25	1
26	1
27	0
28	1
29	4
30	20
31	50
32	82
33	94
34	81
35	59
36	38
37	20
38	10
39	5
40	2
41	1
42	1
43	0
44	1
45	6
46	40
47	161
48	429
49	780
50	1076
51	1197
52	1114
53	885
54	622
55	386
56	215
57	112
58	55
59	24
60	11
61	5
62	2
63	1
64	1
65	0
66	1
67	7
68	70
69	433
70	1729
71	4796

[0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 2, 3, 2, 1, 1, 0, 1, 3, 9, 14, 12, 8, 5, 2, 1, 1, 0, 1, 4, 20, 50, 82, 94, 81, 59, 38, 20, 10, 5, 2, 1, 1, 0, 1, 6, 40, 161, 429, 780, 1076, 1197, 1114, 885, 622, 386, 215, 112, 55, 24, 11, 5, 2, 1, 1, 0, 1, 7, 70, 433, 1729, 4796]

cp's OEIS Frontend

A339071 Triangle read by rows: T(n,k) is the number of unlabeled simple nonseparable (or 2-connected) graphs with n nodes and k edges (n >= 1, n-1 <= k <= n*(n-1)/2).

Table of values

List of values