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

A360882
Number of unlabeled connected multigraphs with n edges, no cut-points and degree >= 3 at each node, loops allowed.
1
0, 1, 3, 5, 10, 21, 45, 114, 330, 1045, 3623, 13545, 53597, 223085, 969159
OFFSET
1,3
FORMULA
a(n) = A360871(n) + 1 for n > 1.
EXAMPLE
The a(3) = 3 multigraphs are:
- a single vertex with 3 loops;
- a triple edge;
- a single edge with a loop at each vertex.
CROSSREFS
Row sums of A360870.
Sequence in context: A284237 A241436 A018107 * A053709 A102772 A018005
KEYWORD
nonn,more
AUTHOR
Andrew Howroyd, Feb 27 2023
STATUS
approved