A339072 - cp's OEIS frontend

A339072 Triangle read by rows: T(n,k) is the number of unlabeled simple 3-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	3
10	4
11	4
12	2
13	1
14	1
15	3
16	14
17	25
18	31
19	28
20	17
21	9
22	5
23	2
24	1
25	1
26	4
27	24
28	101
29	254
30	413
31	475
32	426
33	306
34	187
35	103
36	52
37	23
38	11
39	5
40	2
41	1
42	1
43	19
44	204
45	1068
46	3348
47	7152
48	11199
49	13683
50	13604
51	11374
52	8203
53	5216
54	2963
55	1536
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, 3, 4, 4, 2, 1, 1, 3, 14, 25, 31, 28, 17, 9, 5, 2, 1, 1, 4, 24, 101, 254, 413, 475, 426, 306, 187, 103, 52, 23, 11, 5, 2, 1, 1, 19, 204, 1068, 3348, 7152, 11199, 13683, 13604, 11374, 8203, 5216, 2963, 1536, 737, 333, 144, 62, 25, 11, 5, 2, 1, 1]

cp's OEIS Frontend

A339072 Triangle read by rows: T(n,k) is the number of unlabeled simple 3-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

A339072 Triangle read by rows: T(n,k) is the number of unlabeled simple 3-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

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