OFFSET
1,2
COMMENTS
From Sean A. Irvine, Aug 01 2021: (Start)
A quasi-initially connected digraph is a digraph containing at least one vertex v such that every vertex u in the graph can either be reached from v or v can be reached from u (while obeying the directions on the edges).
There is no known formula. (End)
LINKS
Sean A. Irvine, Java program (github)
V. Jovovic and G. Kilibarda, Enumeration of labeled quasi-initially connected digraphs, Discrete Math., 224 (2000), 151-163.
CROSSREFS
KEYWORD
hard,more,nonn
AUTHOR
Vladeta Jovovic, Goran Kilibarda
EXTENSIONS
a(6)-a(7) from Sean A. Irvine, Aug 01 2021
STATUS
approved