A350449 - cp's OEIS frontend

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

n	a(n)
1	1
2	0
3	1
4	0
5	0
6	3
7	1
8	0
9	0
10	0
11	8
12	9
13	6
14	1
15	0
16	0
17	0
18	0
19	27
20	54
21	79
22	63
23	33
24	10
25	1
26	0
27	0
28	0
29	0
30	0
31	91
32	320
33	732
34	1136
35	1281
36	1056
37	649
38	281
39	85
40	15
41	1
42	0
43	0
44	0
45	0
46	0
47	0
48	350
49	1788
50	6012
51	14378
52	26529
53	38407
54	44621
55	41638
56	31321
57	18843
58	8983
59	3325
60	920
61	180
62	21
63	1

[1, 0, 1, 0, 0, 3, 1, 0, 0, 0, 8, 9, 6, 1, 0, 0, 0, 0, 27, 54, 79, 63, 33, 10, 1, 0, 0, 0, 0, 0, 91, 320, 732, 1136, 1281, 1056, 649, 281, 85, 15, 1, 0, 0, 0, 0, 0, 0, 350, 1788, 6012, 14378, 26529, 38407, 44621, 41638, 31321, 18843, 8983, 3325, 920, 180, 21, 1]

cp's OEIS Frontend

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

Table of values

List of values