|
%I #25 Apr 24 2019 06:12:20
%S 1,2,11,97,1219,20385,433022,11296844,352866598,12938878499,
%T 548257129281,26503637228615,1446212232918009,88278080019931590,
%U 5981590442549971867,446907535344317788261,36602523445840041088223
%N Number of ordered multigraphs on n labeled edges (with loops).
%D G. Paquin, Dénombrement de multigraphes enrichis, Mémoire, Math. Dept., Univ. Québec à Montréal, 2004.
%H G. Labelle, <a href="https://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_{n>=0}1/(n!*(1-x)^binomial(n+1, 2)). - _Vladeta Jovovic_, May 02 2004
%F a(n) = Sum_{k=0..n} (-1)^(n-k) * Stirling1(n, k) * A020555(k). - _Sean A. Irvine_, Apr 24 2019
%Y Cf. A020555, A020558.
%K nonn
%O 0,2
%A Gilbert Labelle (gilbert(AT)lacim.uqam.ca), _Simon Plouffe_
|
