A130768 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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”).

Other ways to Give

A130768

Number of minimally strongly connected digraphs on n labeled vertices.

%I #3 May 10 2013 12:45:49

%S 1,5,58,1069,27816,943669,39757264,2010923289,119153235520,

%T 8118839891161,627023347399296,54258093698028037

%N Number of minimally strongly connected digraphs on n labeled vertices.

%D Kiran Kumar Bhogadi, Decomposition and Generation of Minimal Strongly Connected Digraphs.

%Y Cf. A130756.

%K nonn

%O 2,2

%A _Vladeta Jovovic_, Jul 13 2007