|
%I #14 Jan 13 2021 01:20:05
%S 1,0,1,2,27,164,2335,25458,437241,6965112,145640817,3057675290,
%T 76814951587,2003471245164,59438049704943,1855131250113498,
%U 63937099992148785,2327591284996635888,91854272591000172321,3828194864278619367474,170846746588575658999147
%N Consider the family of directed multigraphs enriched by the species of derangements. Sequence gives number of those multigraphs with n labeled arcs.
%D G. Paquin, Dénombrement de multigraphes enrichis, Mémoire, Math. Dept., Univ. Québec à Montréal, 2004.
%H Andrew Howroyd, <a href="/A098627/b098627.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 A014505 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.; EnrichedGdSeq defined in A098623.
%o R(n)={exp(-x + O(x*x^n))/(1-x)}
%o EnrichedGdSeq(R(20)) \\ _Andrew Howroyd_, Jan 12 2021
%Y Cf. A000166, A014505, A098623, A098624, A098625, A098626.
%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
|
