This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A020558 Number of ordered multigraphs on n labeled edges (without loops). 2
 1, 1, 4, 27, 274, 3874, 71995, 1682448, 47840813, 1615315141, 63566760077, 2873099980637, 147384910116793, 8496500896980637, 545845612016485842, 38797966029876716897, 3032005571734589578076 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 REFERENCES G. Labelle, Counting enriched multigraphs..., Discrete Math., 217 (2000), 237-248. G. Paquin, D\'enombrement de multigraphes enrichis, M\'emoire, Math. Dept., Univ. Qu\'ebec \`a Montr\'eal, 2004. LINKS FORMULA E.g.f.: exp((3*x-2)/(2-2*x))*Sum(1/(n!*(1-x)^binomial(n, 2)), n = 0 .. infinity). a(n) = Sum((-1)^(n-k)*Stirling1(n, k)*A020554(k), k=0..n). - Vladeta Jovovic, May 02 2004 E.g.f.: exp(x/(2-2*x))*Sum(A020556(n)*(-ln(1-x)/2)^n/n!, n=0..infinity). - Vladeta Jovovic, May 02 2004 CROSSREFS Sequence in context: A052871 A104653 A194787 * A193467 A179494 A203157 Adjacent sequences:  A020555 A020556 A020557 * A020559 A020560 A020561 KEYWORD nonn AUTHOR Gilbert Labelle (gilbert(AT)lacim.uqam.ca), Simon Plouffe STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .