The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A003028 Number of n-node digraphs with a source.
(Formerly M3157)

%I M3157

%S 1,3,51,3614,991930,1051469032,4366988803688,71895397383029040,

%T 4719082081411731363408,1237678715644664931691596416,

%U 1297992266840866792981316221144960

%N Number of n-node digraphs with a source.

%D V. Jovovic and G. Kilibarda, Enumeration of labeled initially-finally connected digraphs, Scientific review, Serbian Scientific Society, 19-20 (1996) 237-247.

%D R. W. Robinson, Counting labeled acyclic digraphs, pp. 239-273 of F. Harary, editor, New Directions in the Theory of Graphs. Academic Press, NY, 1973.

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H V. Jovovic and G. Kilibarda, <a href="http://dx.doi.org/10.1016/S0012-365X(00)00112-6">Enumeration of labeled quasi-initially connected digraphs</a>, Discrete Math., 224 (2000), 151-163.

%K nonn,easy,nice

%O 1,2

%A _N. J. A. Sloane_.

%E Corrected and extended by _Vladeta Jovovic_, Goran Kilibarda

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 16 12:23 EDT 2021. Contains 348041 sequences. (Running on oeis4.)