A259873 - cp's OEIS frontend

A259873 Triangle read by rows: T(n,k) (n >= 3, 3 <= k <= n) = number of possible graphical partitions for simple graphs with n non-isolated nodes and k edges.

n	a(n)
3	1
4	0
5	2
6	0
7	1
8	4
9	0
10	1
11	4
12	7
13	0
14	0
15	4
16	9
17	11
18	0
19	0
20	2
21	11
22	15
23	17
24	0
25	0
26	1
27	11
28	22
29	25
30	25
31	0
32	0
33	1
34	9
35	26
36	38
37	37
38	36
39	0
40	0
41	0
42	7
43	29
44	49
45	58
46	55
47	50
48	0
49	0
50	0
51	5
52	29
53	63
54	81
55	87
56	77
57	70

[1, 0, 2, 0, 1, 4, 0, 1, 4, 7, 0, 0, 4, 9, 11, 0, 0, 2, 11, 15, 17, 0, 0, 1, 11, 22, 25, 25, 0, 0, 1, 9, 26, 38, 37, 36, 0, 0, 0, 7, 29, 49, 58, 55, 50, 0, 0, 0, 5, 29, 63, 81, 87, 77, 70]

cp's OEIS Frontend

A259873 Triangle read by rows: T(n,k) (n >= 3, 3 <= k <= n) = number of possible graphical partitions for simple graphs with n non-isolated nodes and k edges.

Table of values

List of values

n	a(n)
3	1
4	0
5	2
6	0
7	1
8	4
9	0
10	1
11	4
12	7
13	0
14	0
15	4
16	9
17	11
18	0
19	0
20	2
21	11
22	15
23	17
24	0
25	0
26	1
27	11
28	22
29	25
30	25
31	0
32	0
33	1
34	9
35	26
36	38
37	37
38	36
39	0
40	0
41	0
42	7
43	29
44	49
45	58
46	55
47	50
48	0
49	0
50	0
51	5
52	29
53	63
54	81
55	87
56	77
57	70

n	a(n)
3	1
4	0
5	2
6	0
7	1
8	4
9	0
10	1
11	4
12	7
13	0
14	0
15	4
16	9
17	11
18	0
19	0
20	2
21	11
22	15
23	17
24	0
25	0
26	1
27	11
28	22
29	25
30	25
31	0
32	0
33	1
34	9
35	26
36	38
37	37
38	36
39	0
40	0
41	0
42	7
43	29
44	49
45	58
46	55
47	50
48	0
49	0
50	0
51	5
52	29
53	63
54	81
55	87
56	77
57	70

n	a(n)
3	1
4	0
5	2
6	0
7	1
8	4
9	0
10	1
11	4
12	7
13	0
14	0
15	4
16	9
17	11
18	0
19	0
20	2
21	11
22	15
23	17
24	0
25	0
26	1
27	11
28	22
29	25
30	25
31	0
32	0
33	1
34	9
35	26
36	38
37	37
38	36
39	0
40	0
41	0
42	7
43	29
44	49
45	58
46	55
47	50
48	0
49	0
50	0
51	5
52	29
53	63
54	81
55	87
56	77
57	70