A361718 - cp's OEIS frontend

A361718 Triangular array read by rows. T(n,k) is the number of labeled directed acyclic graphs on [n] with exactly k nodes of indegree 0.

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

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

cp's OEIS Frontend

A361718 Triangular array read by rows. T(n,k) is the number of labeled directed acyclic graphs on [n] with exactly k nodes of indegree 0.

Table of values

List of values