|
%I #13 Jan 12 2021 18:56:08
%S 1,0,1,2,15,84,750,6852,79639,1006184,14875218,241078100,4392257716,
%T 87279581232,1905609327583,45008114794874,1150897256534370,
%U 31580332783936416,928535967078634497,29090873853321687666,969132936087009709174,34198721664081728281400
%N Consider the family of multigraphs enriched by the species of derangements. Sequence gives number of those multigraphs with n labeled edges.
%D G. Paquin, Dénombrement de multigraphes enrichis, Mémoire, Math. Dept., Univ. Québec à Montréal, 2004.
%H Andrew Howroyd, <a href="/A098624/b098624.txt">Table of n, a(n) for n = 0..200</a>
%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.: B(R(x)) where B(x) is the e.g.f. of A014500 and 1 + R(x) is the e.g.f. of A000166. - _Andrew Howroyd_, Jan 12 2021
%o (PARI) \\ R(n) is A000166 as e.g.f.; EnrichedGnSeq defined in A098620.
%o R(n)={exp(-x + O(x*x^n))/(1-x)}
%o EnrichedGnSeq(R(20)) \\ _Andrew Howroyd_, Jan 12 2021
%Y Cf. A000166, A014500, A098620, A098625, A098626, A098627.
%K nonn
%O 0,4
%A _N. J. A. Sloane_, Oct 26 2004
%E Terms a(14) and beyond from _Andrew Howroyd_, Jan 12 2021
|
