A339069 - cp's OEIS frontend

A339069 Triangle read by rows: T(n,k) is the number of unlabeled simple series-reduced 2-connected graphs with n nodes and k edges (n >= 4, ceiling(3n/2) <= k <= n(n-1)/2).

n	a(n)
4	1
5	1
6	1
7	1
8	2
9	4
10	5
11	4
12	2
13	1
14	1
15	4
16	17
17	30
18	34
19	29
20	17
21	9
22	5
23	2
24	1
25	1
26	5
27	33
28	133
29	307
30	464
31	505
32	438
33	310
34	188
35	103
36	52
37	23
38	11
39	5
40	2
41	1
42	1
43	25
44	277
45	1352
46	3953
47	7939
48	11897
49	14131
50	13827
51	11465
52	8235
53	5226
54	2966
55	1537
56	737
57	333
58	144
59	62
60	25
61	11
62	5
63	2
64	1
65	1

[1, 1, 1, 1, 2, 4, 5, 4, 2, 1, 1, 4, 17, 30, 34, 29, 17, 9, 5, 2, 1, 1, 5, 33, 133, 307, 464, 505, 438, 310, 188, 103, 52, 23, 11, 5, 2, 1, 1, 25, 277, 1352, 3953, 7939, 11897, 14131, 13827, 11465, 8235, 5226, 2966, 1537, 737, 333, 144, 62, 25, 11, 5, 2, 1, 1]

cp's OEIS Frontend

A339069 Triangle read by rows: T(n,k) is the number of unlabeled simple series-reduced 2-connected graphs with n nodes and k edges (n >= 4, ceiling(3n/2) <= k <= n(n-1)/2).

Table of values

List of values

cp's OEIS Frontend

A339069 Triangle read by rows: T(n,k) is the number of unlabeled simple series-reduced 2-connected graphs with n nodes and k edges (n >= 4, ceiling(3*n/2) <= k <= n*(n-1)/2).

Table of values

List of values

A339069 Triangle read by rows: T(n,k) is the number of unlabeled simple series-reduced 2-connected graphs with n nodes and k edges (n >= 4, ceiling(3n/2) <= k <= n(n-1)/2).