login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A307317 Number of unlabeled connected leafless loopless multigraphs with n edges. 3
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
Connected multigraphs with no loops and no vertices of degree 1.
The initial terms were computed with Nauty.
LINKS
P. T. Komiske, E. M. Metodiev, and J. Thaler, Cutting Multiparticle Correlators Down to Size, arXiv:1911.04491 [hep-ph], 2019-2020.
Brendan McKay and Adolfo Piperno, nauty and Traces.
FORMULA
Inverse Euler transform of A307316.
EXAMPLE
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).
Sequence in context: A124835 A125799 A220880 * A188669 A243568 A087378
KEYWORD
nonn
AUTHOR
Eric M. Metodiev, Apr 02 2019
EXTENSIONS
a(0)=1 prepended and a(17) onwards from Andrew Howroyd, Feb 01 2024
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)