A362013 - cp's OEIS frontend

A362013 Triangular array read by rows. T(n,k) is the number of labeled directed graphs on [n] with exactly k strongly connected components of size 1 with outdegree zero, n>=0, 0<=k<=n.

n	a(n)
0	1
1	0
2	1
3	1
4	2
5	1
6	27
7	27
8	9
9	1
10	2401
11	1372
12	294
13	28
14	1
15	759375
16	253125
17	33750
18	2250
19	75
20	1
21	887503681
22	171774906
23	13852815
24	595820
25	14415
26	186
27	1
28	3938980639167
29	437664515463
30	20841167403
31	551353635
32	8751645
33	83349
34	441
35	1
36	67675234241018881
37	4263006881324024
38	117484441611292
39	1850148686792
40	18210124870
41	114709448
42	451612
43	1016
44	1

[1, 0, 1, 1, 2, 1, 27, 27, 9, 1, 2401, 1372, 294, 28, 1, 759375, 253125, 33750, 2250, 75, 1, 887503681, 171774906, 13852815, 595820, 14415, 186, 1, 3938980639167, 437664515463, 20841167403, 551353635, 8751645, 83349, 441, 1, 67675234241018881, 4263006881324024, 117484441611292, 1850148686792, 18210124870, 114709448, 451612, 1016, 1]

cp's OEIS Frontend

A362013 Triangular array read by rows. T(n,k) is the number of labeled directed graphs on [n] with exactly k strongly connected components of size 1 with outdegree zero, n>=0, 0<=k<=n.

Table of values

List of values