[go: up one dir, main page]

login
A098636
Consider the family of multigraphs enriched by the species of odd sets. Sequence gives number of those multigraphs with n labeled edges.
3
1, 1, 2, 10, 78, 885, 13487, 261848, 6255453, 179297990, 6046396379, 236175330388, 10549286540957, 533103416306743, 30203144498636380, 1903491404510540902, 132543022174482851436, 10136316177816553484295, 846893706267135762556915, 76941424170126460702604994
OFFSET
0,3
REFERENCES
G. Paquin, Dénombrement de multigraphes enrichis, Mémoire, Math. Dept., Univ. Québec à Montréal, 2004.
LINKS
G. Paquin, Dénombrement de multigraphes enrichis, Mémoire, Math. Dept., Univ. Québec à Montréal, 2004. [Cached copy, with permission]
FORMULA
E.g.f.: B(sinh(x)) where B(x) is the e.g.f. of A014500. - Andrew Howroyd, Jan 12 2021
PROG
(PARI) \\ EnrichedGnSeq defined in A098620.
EnrichedGnSeq(sinh(x + O(x*x^20))) \\ Andrew Howroyd, Jan 12 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Oct 26 2004
EXTENSIONS
Terms a(12) and beyond from Andrew Howroyd, Jan 12 2021
STATUS
approved