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!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
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

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 25 05:56 EDT 2024. Contains 371964 sequences. (Running on oeis4.)