A058878 - cp's OEIS frontend

A058878 Triangle T(n,k) is the number of labeled graphs of even degree with n nodes and k edges (n >= 0, 0 <= k <= n(n-1)/2).

n	a(n)
0	1
1	1
2	1
3	0
4	1
5	0
6	0
7	1
8	1
9	0
10	0
11	4
12	3
13	0
14	0
15	1
16	0
17	0
18	10
19	15
20	12
21	15
22	10
23	0
24	0
25	1
26	1
27	0
28	0
29	20
30	45
31	72
32	160
33	240
34	195
35	120
36	96
37	60
38	15
39	0
40	0
41	0
42	1
43	0
44	0
45	35
46	105
47	252
48	805
49	1935
50	3255
51	4515
52	5481
53	5481
54	4515
55	3255
56	1935
57	805
58	252
59	105
60	35
61	0
62	0
63	1
64	1
65	0
66	0
67	56

[1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 4, 3, 0, 0, 1, 0, 0, 10, 15, 12, 15, 10, 0, 0, 1, 1, 0, 0, 20, 45, 72, 160, 240, 195, 120, 96, 60, 15, 0, 0, 0, 1, 0, 0, 35, 105, 252, 805, 1935, 3255, 4515, 5481, 5481, 4515, 3255, 1935, 805, 252, 105, 35, 0, 0, 1, 1, 0, 0, 56]

cp's OEIS Frontend

A058878 Triangle T(n,k) is the number of labeled graphs of even degree with n nodes and k edges (n >= 0, 0 <= k <= n(n-1)/2).

Table of values

List of values