%I #13 Jan 13 2021 01:21:11
%S 1,1,6,69,1230,30663,1005692,41571127,2099861244,126607647073,
%T 8945129371976,729628409684925,67868881258920424,7125522244948969319,
%U 837004398237510194704,109173596976047915341823,15708090522743045757716496,2478722722731315203268137729
%N Consider the family of directed multigraphs enriched by the species of odd sets. 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="/A098639/b098639.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(sinh(x)) where B(x) is the e.g.f. of A014505. - _Andrew Howroyd_, Jan 12 2021
%o (PARI) \\ EnrichedGdSeq defined in A098623.
%o EnrichedGdSeq(sinh(x + O(x*x^20))) \\ _Andrew Howroyd_, Jan 12 2021
%Y Cf. A014505, A098623, A098636, A098637, A098638.
%K nonn
%O 0,3
%A _N. J. A. Sloane_, Oct 26 2004
%E Terms a(12) and beyond from _Andrew Howroyd_, Jan 12 2021