Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003029
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003029 Number of unilaterally connected digraphs with n nodes.
(Formerly M3156)
+0
5
1, 3, 48, 3400, 955860, 1034141596, 4340689156440, 71756043154026904, 4716284688998245793376, 1237457313794197125403483936, 1297922676419612772784598299454784 (list; graph; listen)
OFFSET

1,2

REFERENCES

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.

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

CROSSREFS

Sequence in context: A007654 A001080 A099852 this_sequence A049524 A033493 A094045

Adjacent sequences: A003026 A003027 A003028 this_sequence A003030 A003031 A003032

KEYWORD

nonn,nice,easy

AUTHOR

njas

EXTENSIONS

Corrected and extended by Vladeta Jovovic, Goran Kilibarda (vladeta(AT)Eunet.yu)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research