A283822 - cp's OEIS frontend

A283822 Triangle read by rows: T(n,k) (n>=1, 2<=k<=n+1) = number of graphs with n edges, no isolated nodes, and k nodes in largest connected component.

n	a(n)
1	1
2	1
3	1
4	1
5	2
6	2
7	1
8	3
9	4
10	3
11	1
12	4
13	7
14	8
15	6
16	1
17	6
18	15
19	16
20	19
21	11
22	1
23	7
24	24
25	34
26	44
27	44
28	23
29	1
30	9
31	38
32	71
33	97
34	122
35	112
36	47
37	1
38	11
39	61
40	133
41	211
42	295
43	371
44	287
45	106
46	1
47	13
48	90
49	249
50	457
51	659
52	1015
53	1131
54	763
55	235

[1, 1, 1, 1, 2, 2, 1, 3, 4, 3, 1, 4, 7, 8, 6, 1, 6, 15, 16, 19, 11, 1, 7, 24, 34, 44, 44, 23, 1, 9, 38, 71, 97, 122, 112, 47, 1, 11, 61, 133, 211, 295, 371, 287, 106, 1, 13, 90, 249, 457, 659, 1015, 1131, 763, 235]

cp's OEIS Frontend

A283822 Triangle read by rows: T(n,k) (n>=1, 2<=k<=n+1) = number of graphs with n edges, no isolated nodes, and k nodes in largest connected component.

Table of values

List of values