A259862 - cp's OEIS frontend

A259862 Triangle read by rows: T(n,k) = number of unlabeled graphs with n nodes and connectivity exactly k (n>=1, 0<=k<=n-1).

n	a(n)
1	1
2	1
3	1
4	2
5	1
6	1
7	5
8	3
9	2
10	1
11	13
12	11
13	7
14	2
15	1
16	44
17	56
18	39
19	13
20	3
21	1
22	191
23	385
24	332
25	111
26	21
27	3
28	1
29	1229
30	3994
31	4735
32	2004
33	345
34	34
35	4
36	1
37	13588
38	67014
39	113176
40	66410
41	13429
42	992
43	54
44	4
45	1
46	288597
47	1973029
48	4629463
49	3902344
50	1109105
51	99419
52	3124
53	81
54	5
55	1
56	12297299
57	105731474
58	327695586
59	388624106
60	162318088
61	21500415
62	820956
63	9813
64	121
65	5
66	1

[1, 1, 1, 2, 1, 1, 5, 3, 2, 1, 13, 11, 7, 2, 1, 44, 56, 39, 13, 3, 1, 191, 385, 332, 111, 21, 3, 1, 1229, 3994, 4735, 2004, 345, 34, 4, 1, 13588, 67014, 113176, 66410, 13429, 992, 54, 4, 1, 288597, 1973029, 4629463, 3902344, 1109105, 99419, 3124, 81, 5, 1, 12297299, 105731474, 327695586, 388624106, 162318088, 21500415, 820956, 9813, 121, 5, 1]

cp's OEIS Frontend

A259862 Triangle read by rows: T(n,k) = number of unlabeled graphs with n nodes and connectivity exactly k (n>=1, 0<=k<=n-1).

Table of values

List of values