login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A307317 Number of connected leafless multigraphs with n edges. 1
0, 1, 2, 4, 9, 26, 68, 217, 718, 2553, 9574, 38005, 157306, 679682, 3047699, 14150278 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

Connected multigraphs with no loops and no degree-1 vertices. Computed with Nauty.

REFERENCES

P. T. Komiske, E. M. Metodiev, J. Thaler, Cutting Multiparticle Correlators Down to Size. arxiv:1911.04491 [hep-ph] (2019)

LINKS

Table of n, a(n) for n=1..16.

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

A307316 can be obtained from this sequence by combinatorics.

Sequence in context: A124835 A125799 A220880 * A188669 A243568 A087378

Adjacent sequences:  A307314 A307315 A307316 * A307318 A307319 A307320

KEYWORD

nonn,more

AUTHOR

Eric M. Metodiev, Apr 02 2019

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 18 15:30 EST 2020. Contains 332019 sequences. (Running on oeis4.)