Consider the family of multigraphs enriched by the species of partitions. Sequence gives number of those multigraphs with n loops and edges.

A098621

Consider the family of multigraphs enriched by the species of partitions. Sequence gives number of those multigraphs with n loops and edges.

Terms

    a(0) =1a(1) =2a(2) =11a(3) =95a(4) =1173a(5) =19364a(6) =407447a(7) =10552664a(8) =327719713a(9) =119600021230a(10) =504784756672

External references