login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A098343
Consider the family of multigraphs enriched by the species of binary arborescences. Sequence gives number of those multigraphs with n edges and loops.
0
1, 2, 15, 187, 3283, 74825, 2109272, 71217488, 2815154006, 128079232835, 6618682431711, 384397221347345
OFFSET
0,2
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]
CROSSREFS
Sequence in context: A319834 A268420 A208402 * A052819 A349292 A328121
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Oct 26 2004
STATUS
approved