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

 

Logo

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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A307316 Number of leafless multigraphs with n edges. 1
0, 1, 2, 5, 11, 34, 87, 279, 897, 3129, 11458, 44576, 181071, 770237, 3407332, 15641159 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

Multigraphs with no loops and no degree-1 vertices. Computed with Nauty.

Conjecturally, the asymptotic number of completely symmetric polynomials of degree n up to momentum conservation in the limit as the number of particles increases.

LINKS

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

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

EXAMPLE

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

CROSSREFS

Conjecturally the same as A226919. Can be obtained from A307317 by combinatorics.

Sequence in context: A254342 A080068 A226919 * A298122 A196690 A101834

Adjacent sequences: A307313 A307314 A307315 * A307317 A307318 A307319

KEYWORD

nonn,more

AUTHOR

Patrick T. Komiske, 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 1 01:13 EST 2022. Contains 358453 sequences. (Running on oeis4.)