A350909 - cp's OEIS frontend

A350909 Triangle read by rows: T(n,k) is the number of weakly connected acyclic digraphs on n labeled nodes with k arcs, k=0..n*(n-1).

n	a(n)
1	1
2	0
3	2
4	0
5	0
6	12
7	6
8	0
9	0
10	0
11	128
12	186
13	108
14	24
15	0
16	0
17	0
18	0
19	2000
20	5640
21	7840
22	6540
23	3330
24	960
25	120
26	0
27	0
28	0
29	0
30	0
31	41472
32	189480
33	456720
34	730830
35	832370
36	690300
37	416160
38	178230
39	51480
40	9000
41	720
42	0
43	0
44	0
45	0
46	0
47	0
48	1075648
49	7178640
50	26035800
51	65339820

[1, 0, 2, 0, 0, 12, 6, 0, 0, 0, 128, 186, 108, 24, 0, 0, 0, 0, 2000, 5640, 7840, 6540, 3330, 960, 120, 0, 0, 0, 0, 0, 41472, 189480, 456720, 730830, 832370, 690300, 416160, 178230, 51480, 9000, 720, 0, 0, 0, 0, 0, 0, 1075648, 7178640, 26035800, 65339820]

cp's OEIS Frontend

A350909 Triangle read by rows: T(n,k) is the number of weakly connected acyclic digraphs on n labeled nodes with k arcs, k=0..n*(n-1).

Table of values

List of values