A201922 - cp's OEIS frontend

A201922 Triangle read by rows: T(n,m) = number of unlabeled graphs on n nodes with m connected components, m = 1,2,...,n.

n	a(n)
1	1
2	1
3	1
4	2
5	1
6	1
7	6
8	3
9	1
10	1
11	21
12	8
13	3
14	1
15	1
16	112
17	30
18	9
19	3
20	1
21	1
22	853
23	145
24	32
25	9
26	3
27	1
28	1
29	11117
30	1028
31	154
32	33
33	9
34	3
35	1
36	1
37	261080
38	12320
39	1065
40	156
41	33
42	9
43	3
44	1
45	1
46	11716571
47	274806
48	12513
49	1074
50	157
51	33
52	9
53	3
54	1
55	1
56	1006700565
57	12007355
58	276114
59	12550
60	1076
61	157
62	33
63	9
64	3
65	1
66	1

[1, 1, 1, 2, 1, 1, 6, 3, 1, 1, 21, 8, 3, 1, 1, 112, 30, 9, 3, 1, 1, 853, 145, 32, 9, 3, 1, 1, 11117, 1028, 154, 33, 9, 3, 1, 1, 261080, 12320, 1065, 156, 33, 9, 3, 1, 1, 11716571, 274806, 12513, 1074, 157, 33, 9, 3, 1, 1, 1006700565, 12007355, 276114, 12550, 1076, 157, 33, 9, 3, 1, 1]

cp's OEIS Frontend

A201922 Triangle read by rows: T(n,m) = number of unlabeled graphs on n nodes with m connected components, m = 1,2,...,n.

Table of values

List of values