A361588 - cp's OEIS frontend

A361588 Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled nodes with k strongly connected components and without isolated nodes.

n	a(n)
0	1
1	0
2	0
3	0
4	1
5	1
6	0
7	5
8	4
9	4
10	0
11	83
12	57
13	37
14	25
15	0
16	5048
17	2411
18	1110
19	550
20	271
21	0
22	1047008
23	325015
24	101467
25	37140
26	15024
27	5682
28	0
29	705422362
30	136887749
31	27765860
32	7139149
33	2259378
34	780314
35	237684
36	0
37	1580348371788
38	183852357683
39	23088181536
40	3923330808
41	907186816
42	258971872
43	78716548
44	20042357

[1, 0, 0, 0, 1, 1, 0, 5, 4, 4, 0, 83, 57, 37, 25, 0, 5048, 2411, 1110, 550, 271, 0, 1047008, 325015, 101467, 37140, 15024, 5682, 0, 705422362, 136887749, 27765860, 7139149, 2259378, 780314, 237684, 0, 1580348371788, 183852357683, 23088181536, 3923330808, 907186816, 258971872, 78716548, 20042357]

cp's OEIS Frontend

A361588 Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled nodes with k strongly connected components and without isolated nodes.

Table of values

List of values