|
|
A098638
|
|
Consider the family of directed multigraphs enriched by the species of odd sets. Sequence gives number of those multigraphs with n labeled loops and arcs.
|
|
3
|
|
|
1, 2, 13, 164, 3127, 82600, 2845775, 122820136, 6446913953, 402413160952, 29343933156485, 2464029760993520, 235446319553848087, 25346231173047308256, 3047931031445529965527, 406412844141860523543392, 59704680455100785101683457, 9608818815170839730520275488
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
REFERENCES
|
G. Paquin, Dénombrement de multigraphes enrichis, Mémoire, Math. Dept., Univ. Québec à Montréal, 2004.
|
|
LINKS
|
|
|
FORMULA
|
E.g.f.: exp(-1)*Sum_{n>=0}(1+sinh(x))^(n^2)/n!. - Vladeta Jovovic, Mar 04 2008
|
|
PROG
|
(PARI) \\ EnrichedGdlSeq defined in A098622.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Missing a(10) inserted and terms a(13) and beyond from Andrew Howroyd, Jan 12 2021
|
|
STATUS
|
approved
|
|
|
|