A380252 - cp's OEIS frontend

A380252 Triangular array read by rows: T(n,k) is the number of labeled acyclic digraphs on n vertices with exactly k weakly connected components, n>=0, 0<=k<=n.

n	a(n)
0	1
1	0
2	1
3	0
4	2
5	1
6	0
7	18
8	6
9	1
10	0
11	446
12	84
13	12
14	1
15	0
16	26430
17	2590
18	240
19	20
20	1
21	0
22	3596762
23	175200
24	8970
25	540
26	30
27	1
28	0
29	1111506858
30	26568374
31	678930
32	24010
33	1050
34	42
35	1
36	0
37	774460794326
38	9127077036
39	112393736
40	2007600
41	54740
42	1848
43	56
44	1
45	0
46	1206342801843750
47	7057099207134
48	42191272116
49	357391608
50	5013540
51	111636
52	3024
53	72
54	1

[1, 0, 1, 0, 2, 1, 0, 18, 6, 1, 0, 446, 84, 12, 1, 0, 26430, 2590, 240, 20, 1, 0, 3596762, 175200, 8970, 540, 30, 1, 0, 1111506858, 26568374, 678930, 24010, 1050, 42, 1, 0, 774460794326, 9127077036, 112393736, 2007600, 54740, 1848, 56, 1, 0, 1206342801843750, 7057099207134, 42191272116, 357391608, 5013540, 111636, 3024, 72, 1]

cp's OEIS Frontend

A380252 Triangular array read by rows: T(n,k) is the number of labeled acyclic digraphs on n vertices with exactly k weakly connected components, n>=0, 0<=k<=n.

Table of values

List of values