login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A049512
Number of quasi-initially connected digraphs on n unlabeled nodes.
4
1, 2, 13, 197, 9312, 1528634, 880277970
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