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

A098621
Consider the family of multigraphs enriched by the species of partitions. Sequence gives number of those multigraphs with n loops and edges.
3
1, 2, 11, 95, 1173, 19364, 407447, 10552664, 327719713, 119600021230, 504784756672, 24321086122048
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: A236962 A292916 A290586 * A266834 A131407 A197994
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Oct 26 2004
STATUS
approved