|
|
A098624
|
|
Consider the family of multigraphs enriched by the species of derangements. Sequence gives number of those multigraphs with n labeled edges.
|
|
3
|
|
|
1, 0, 1, 2, 15, 84, 750, 6852, 79639, 1006184, 14875218, 241078100, 4392257716, 87279581232, 1905609327583, 45008114794874, 1150897256534370, 31580332783936416, 928535967078634497, 29090873853321687666, 969132936087009709174, 34198721664081728281400
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
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 A000166 as e.g.f.; EnrichedGnSeq defined in A098620.
R(n)={exp(-x + O(x*x^n))/(1-x)}
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|