|
Search: id:A020559
|
|
|
| A020559 |
|
Number of ordered multigraphs on n labeled edges (with loops). |
|
+0
1
|
|
| 1, 2, 11, 97, 1219, 20385, 433022, 11296844, 352866598, 12938878499, 548257129281, 26503637228615, 1446212232918009, 88278080019931590, 5981590442549971867, 446907535344317788261, 36602523445840041088223
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
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.
|
|
FORMULA
|
E.g.f.: exp((3*x-2)/(2-2*x))*Sum(1/(n!*(1-x)^binomial(n+1, 2)), n = 0 .. infinity). - Vladeta Jovovic (vladeta(AT)eunet.rs), May 02 2004
|
|
CROSSREFS
|
Cf. A020558.
Sequence in context: A138210 A136344 A055680 this_sequence A003579 A099169 A143135
Adjacent sequences: A020556 A020557 A020558 this_sequence A020560 A020561 A020562
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Gilbert Labelle (gilbert(AT)lacim.uqam.ca), Simon Plouffe (simon.plouffe(AT)gmail.com)
|
|
|
Search completed in 0.002 seconds
|
