A058876 - cp's OEIS frontend

A058876 Triangle read by rows: T(n,k) = number of labeled acyclic digraphs with n nodes, containing exactly n+1-k points of in-degree zero (n >= 1, 1<=k<=n).

n	a(n)
1	1
2	1
3	2
4	1
5	9
6	15
7	1
8	28
9	198
10	316
11	1
12	75
13	1610
14	10710
15	16885
16	1
17	186
18	10575
19	211820
20	1384335
21	2174586
22	1
23	441
24	61845
25	3268125
26	64144675
27	416990763
28	654313415
29	1
30	1016
31	336924
32	43832264
33	2266772550
34	44218682312
35	286992935964
36	450179768312

[1, 1, 2, 1, 9, 15, 1, 28, 198, 316, 1, 75, 1610, 10710, 16885, 1, 186, 10575, 211820, 1384335, 2174586, 1, 441, 61845, 3268125, 64144675, 416990763, 654313415, 1, 1016, 336924, 43832264, 2266772550, 44218682312, 286992935964, 450179768312]

cp's OEIS Frontend

A058876 Triangle read by rows: T(n,k) = number of labeled acyclic digraphs with n nodes, containing exactly n+1-k points of in-degree zero (n >= 1, 1<=k<=n).

Table of values

List of values