A366350 - cp's OEIS frontend

A366350 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 then there is a directed edge from x to y or from y to x.

n	a(n)
0	1
1	2
2	12
3	240
4	29056
5	18656960
6	47473519744
7	452285200546816
8	16275391021965395968
9	2253596336074652670148608
10	1219094258112479334941371285504
11	2601963635581642923807860961645363200

[1, 2, 12, 240, 29056, 18656960, 47473519744, 452285200546816, 16275391021965395968, 2253596336074652670148608, 1219094258112479334941371285504, 2601963635581642923807860961645363200]

cp's OEIS Frontend

A366350 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 then there is a directed edge from x to y or from y to x.

Table of values

List of values