|
|
A099692
|
|
Consider the family of multigraphs enriched by the species of directed sets. Sequence gives number of those multigraphs with n labeled edges.
|
|
3
|
|
|
1, 1, 4, 23, 220, 3016, 55011, 1265824, 35496711, 1183686987, 46072834777, 2062557088117, 104926356851165, 6004962409831577, 383331023991407286, 27094756978689827593, 2107021273883402908850, 179261681391054814324774, 16602830645109035036038335
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
REFERENCES
|
G. Paquin, Dénombrement de multigraphes enrichis, Mémoire, Math. Dept., Univ. Québec à Montréal, 2004.
|
|
LINKS
|
|
|
FORMULA
|
|
|
PROG
|
(PARI) \\ R(n) is e.g.f. of 1, 1, 2, 2, 2, 2, ...; EnrichedGnSeq defined in A098620.
R(n)={2*exp(x + O(x*x^n)) - x - 1}
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|