%I #20 Aug 09 2024 16:21:02

%S 1,1,4,27,274,3874,71995,1682448,47840813,1615315141,63566760077,

%T 2873099980637,147384910116793,8496500896980637,545845612016485842,

%U 38797966029876716897,3032005571734589578076

%N Number of ordered multigraphs on n labeled edges (without loops).

%D G. Paquin, Dénombrement de multigraphes enrichis, Mémoire, Math. Dept., Univ. Québec à Montréal, 2004.

%H G. Labelle, <a href="http://dx.doi.org/10.1016/S0012-365X(99)00265-4">Counting enriched multigraphs according to the number of their edges (or arcs)</a>, Discrete Math., 217 (2000), 237-248.

%H G. Paquin, <a href="/A038205/a038205.pdf">Dénombrement de multigraphes enrichis</a>, Mémoire, Math. Dept., Univ. Québec à Montréal, 2004. [Cached copy, with permission]

%F 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

%F E.g.f.: exp(x/(2-2*x))*Sum(A020556(n)*(-log(1-x)/2)^n/n!, n=0..infinity). - _Vladeta Jovovic_, May 02 2004

%K nonn

%O 0,3

%A Gilbert Labelle (gilbert(AT)lacim.uqam.ca), _Simon Plouffe_