A366396 - cp's OEIS frontend

A366396 Number of labeled directed graphs on [n] with self loops allowed such that the following implication holds for all x,y in [n]. If x and y are in distinct strongly connected components and y is reachable from x then there is a directed edge from x to y.

n	a(n)
0	1
1	2
2	16
3	368
4	34624
5	19194752
6	47730489856
7	452968293106688
8	16282682505688059904
9	2253889950034687424110592
10	1219139359408849690950674415616
11	2601990460616856808147727573494857728
12	22041041736721298233193355574294486210576384

[1, 2, 16, 368, 34624, 19194752, 47730489856, 452968293106688, 16282682505688059904, 2253889950034687424110592, 1219139359408849690950674415616, 2601990460616856808147727573494857728, 22041041736721298233193355574294486210576384]

cp's OEIS Frontend

A366396 Number of labeled directed graphs on [n] with self loops allowed such that the following implication holds for all x,y in [n]. If x and y are in distinct strongly connected components and y is reachable from x then there is a directed edge from x to y.

Table of values

List of values