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”).

A099701
Consider the family of multigraphs enriched by the species of simple graphs. Sequence gives number of those multigraphs with n loops and edges.
2
1, 2, 11, 101, 1355, 24733, 597686, 19975138, 1157593462, 177427216131, 76854836746273, 75062022205128613
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: A374350 A337017 A121419 * A089393 A069664 A130150
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Oct 26 2004
STATUS
approved