A361592 - cp's OEIS frontend

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

n	a(n)
0	1
1	0
2	1
3	1
4	0
5	3
6	18
7	21
8	0
9	25
10	1699
11	1080
12	774
13	0
14	543
15	587940
16	267665
17	103860
18	59830
19	0
20	29281
21	750744901
22	225144360
23	64169325
24	19791000
25	10110735
26	0
27	3781503
28	3556390155318
29	672637205149
30	126726655860
31	29445913175
32	7939815030
33	3767987307
34	0
35	1138779265

[1, 0, 1, 1, 0, 3, 18, 21, 0, 25, 1699, 1080, 774, 0, 543, 587940, 267665, 103860, 59830, 0, 29281, 750744901, 225144360, 64169325, 19791000, 10110735, 0, 3781503, 3556390155318, 672637205149, 126726655860, 29445913175, 7939815030, 3767987307, 0, 1138779265]

cp's OEIS Frontend

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

Table of values

List of values