A341743 - cp's OEIS frontend

A341743 T(n,k) is the number of labeled Eulerian graphs with n vertices and k edges (according to Harary and Palmer) or the number of labeled connected Eulerian graphs with n vertices and k edges (according to Mallows and Sloane); irregular triangle T, read by rows (n >= 0 and 0 <= k <= n*(n-1)/2).

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

[0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 12, 15, 10, 0, 0, 1, 0, 0, 0, 0, 0, 0, 60, 180, 195, 120, 90, 60, 15, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 360, 1890, 3675, 4830, 5061, 4410, 3255, 1935, 805, 252, 105, 35, 0, 0, 1]

cp's OEIS Frontend

A341743 T(n,k) is the number of labeled Eulerian graphs with n vertices and k edges (according to Harary and Palmer) or the number of labeled connected Eulerian graphs with n vertices and k edges (according to Mallows and Sloane); irregular triangle T, read by rows (n >= 0 and 0 <= k <= n*(n-1)/2).

Table of values

List of values