%I #35 Dec 10 2018 16:43:17
%S 1,1,3,16,139,1750,29388,624889,16255738,504717929,18353177160,
%T 769917601384,36803030137203,1984024379014193,119571835094300406,
%U 7995677265437541258,589356399302126773920,47609742627231823142029,4193665147256300117666879
%N Number of multigraphs on n labeled edges (without loops).
%C Or, number of bicoverings of an n-set.
%C Or, number of 2-covers of [1,...,n].
%C Also the number of set multipartitions (multisets of sets) of {1, 1, 2, 2, 3, 3, ..., n, n}. - _Gus Wiseman_, Jul 18 2018
%D G. Paquin, Dénombrement de multigraphes enrichis, Mémoire, Math. Dept., Univ. Québec à Montréal, 2004.
%H Alois P. Heinz, <a href="/A020554/b020554.txt">Table of n, a(n) for n = 0..100</a>
%H Peter Cameron, Thomas Prellberg, Dudley Stark, <a href="http://dx.doi.org/10.1016/j.disc.2008.09.008">Asymptotic enumeration of 2-covers and line graphs</a>, Discrete Math. 310 (2010), no. 2, 230-240 (see s_n).
%H L. Comtet, <a href="/A002718/a002718.pdf">Birecouvrements et birevêtements d’un ensemble fini</a>, Studia Sci. Math. Hungar 3 (1968): 137-152. [Annotated scanned copy. Warning: the table of v(n,k) has errors.]
%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/2+exp(x)/2)*Sum(exp(binomial(n, 2)*x)/n!, n=0..infinity) [Comtet]. - _Vladeta Jovovic_, Apr 27 2004
%F E.g.f. (an equivalent version in Maple format): G:=exp(-1+(exp(z)-1)/2)*sum(exp(s*(s-1)*z/2)/s!, s=0..infinity);
%F E.g.f.: exp((exp(x)-1)/2)*Sum(A020556(n)*(x/2)^n/n!, n=0..infinity). - _Vladeta Jovovic_, May 02 2004
%F Stirling_2 transform of A014500.
%F The e.g.f.'s of A020554 (S(x)) and A014500 (U(x)) are related by S(x) = U(e^x-1).
%e From _Gus Wiseman_, Jul 18 2018: (Start)
%e The a(3) = 16 set multipartitions of {1, 1, 2, 2, 3, 3}:
%e (123)(123)
%e (1)(23)(123) (2)(13)(123) (3)(12)(123) (12)(13)(23)
%e (1)(1)(23)(23) (1)(2)(3)(123) (1)(2)(13)(23) (1)(3)(12)(23) (2)(2)(13)(13) (2)(3)(12)(13) (3)(3)(12)(12)
%e (1)(1)(2)(3)(23) (1)(2)(2)(3)(13) (1)(2)(3)(3)(12)
%e (1)(1)(2)(2)(3)(3)
%e (End)
%t Ceiling[ CoefficientList[ Series[ Exp[ -1 + (Exp[ z ] - 1)/2 ]Sum[ Exp[ s(s - 1)z/2 ]/s!, {s, 0, 21} ], {z, 0, 9} ], z ] Table[ n!, {n, 0, 9} ] ] (* _Mitch Harris_, May 01 2004 *)
%t sps[{}]:={{}};sps[set:{i_,___}]:=Join@@Function[s,Prepend[#,s]&/@sps[Complement[set,s]]]/@Cases[Subsets[set],{i,___}];
%t mps[set_]:=Union[Sort[Sort/@(#/.x_Integer:>set[[x]])]&/@sps[Range[Length[set]]]];
%t Table[Length[Select[mps[Ceiling[Range[1/2,n,1/2]]],And@@UnsameQ@@@#&]],{n,5}] (* _Gus Wiseman_, Jul 18 2018 *)
%Y Row 2 of A188392.
%Y Cf. A002718, A007716, A020555, A050535, A094574, A316974.
%K nonn,nice,easy
%O 0,3
%A Gilbert Labelle (gilbert(AT)lacim.uqam.ca), _Simon Plouffe_