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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A020559 Number of ordered multigraphs on n labeled edges (with loops). 0
 1, 2, 11, 97, 1219, 20385, 433022, 11296844, 352866598, 12938878499, 548257129281, 26503637228615, 1446212232918009, 88278080019931590, 5981590442549971867, 446907535344317788261, 36602523445840041088223 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 REFERENCES G. Paquin, Dénombrement de multigraphes enrichis, Mémoire, Math. Dept., Univ. Québec à Montréal, 2004. LINKS G. Labelle, Counting enriched multigraphs according to the number of their edges (or arcs), Discrete Math., 217 (2000), 237-248. G. Paquin, Dénombrement de multigraphes enrichis, Mémoire, Math. Dept., Univ. Québec à Montréal, 2004. [Cached copy, with permission] FORMULA E.g.f.: exp((3*x-2)/(2-2*x))*Sum_{n>=0}1/(n!*(1-x)^binomial(n+1, 2)). - Vladeta Jovovic, May 02 2004 a(n) = Sum_{k=0..n} (-1)^(n-k) * Stirling1(n, k) * A020555(k). - Sean A. Irvine, Apr 24 2019 CROSSREFS Cf. A020555, A020558. Sequence in context: A055680 A260957 A166909 * A230889 A003579 A282640 Adjacent sequences:  A020556 A020557 A020558 * A020560 A020561 A020562 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 | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 5 22:41 EDT 2021. Contains 346488 sequences. (Running on oeis4.)