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.
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.
Terms
- a(0) =1a(1) =2a(2) =12a(3) =240a(4) =29056a(5) =18656960a(6) =47473519744
External references
- oeis: A366350