cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

User: Eric M. Metodiev

Eric M. Metodiev's wiki page.

Eric M. Metodiev has authored 1 sequences.

A307317 Number of unlabeled connected leafless loopless multigraphs with n edges.

Original entry on oeis.org

1, 0, 1, 2, 4, 9, 26, 68, 217, 718, 2553, 9574, 38005, 157306, 679682, 3047699, 14150278, 67844305, 335262807, 1704500229, 8902528600, 47704608478, 261960998230, 1472618327415, 8466681788462, 49743177379613, 298407523833717, 1826531247381194, 11399711132242500, 72500116125222893, 469578870456459042
Offset: 0

Author

Eric M. Metodiev, Apr 02 2019

Keywords

Comments

Connected multigraphs with no loops and no vertices of degree 1.
The initial terms were computed with Nauty.

Examples

			For n=3 the multigraphs (as sets of edges) are {(0,1),(0,1),(0,1)} and {(0,1),(0,2),(1,2)}.
		

Crossrefs

Cf. A076864, A307316 (not necessarily connected), A342556 (simple graphs).

Formula

Inverse Euler transform of A307316.

Extensions

a(0)=1 prepended and a(17) onwards from Andrew Howroyd, Feb 01 2024