|
%I #12 Jan 12 2021 21:32:19
%S 1,2,17,258,5771,174528,6770119,324895980,18781627193,1281239711000,
%T 101465766593553,9204346831406488,945843113150930899,
%U 109072242262950463552,14001689466624210245831,1986950788160317182000976,309800790825415866952825137,52786928631190620809803203872
%N Consider the family of directed multigraphs enriched by the species of arborescences. Sequence gives number of those multigraphs with n labeled loops and arcs.
%D G. Paquin, Dénombrement de multigraphes enrichis, Mémoire, Math. Dept., Univ. Québec à Montréal, 2004.
%H Andrew Howroyd, <a href="/A099714/b099714.txt">Table of n, a(n) for n = 0..100</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 A014507 and R(x) is the e.g.f. of A000169. - _Andrew Howroyd_, Jan 12 2021
%o (PARI) \\ R(n) is A000169 as e.g.f.; EnrichedGdlSeq defined in A098622.
%o R(n)={-lambertw(-x + O(x*x^n))}
%o EnrichedGdlSeq(R(20)) \\ _Andrew Howroyd_, Jan 12 2021
%Y Cf. A000169, A014507, A098622, A099712, A099713, A099715.
%K nonn
%O 0,2
%A _N. J. A. Sloane_, Oct 26 2004
%E Terms a(12) and beyond from _Andrew Howroyd_, Jan 12 2021
|
