login
A010357
Number of unlabeled nonseparable (or 2-connected) loopless multigraphs with n edges.
5
1, 1, 2, 3, 6, 14, 32, 90, 279, 942, 3468, 13777, 57747, 254671, 1170565, 5580706, 27487418, 139477796, 727458338, 3893078684, 21346838204, 119787629215, 687200870250
OFFSET
1,3
COMMENTS
Original name: Multi-edge stars with n edges.
LINKS
George A. Baker Jr. and John M. Kincaid, The continuous-spin Ising model, g0:phi4:d field theory, and the renormalization group, J. Statist. Phys. 24 (1981), no. 3, 469-528.
Brendan McKay and Adolfo Piperno, nauty and Traces, programs for computing automorphism groups of graphs and digraphs.
EXAMPLE
From Andrew Howroyd, Nov 23 2020: (Start)
The a(1) = 1 graph is a single edge (K_2 = P_2).
The a(2) = 1 graph is a double edge.
The a(3) = 2 graphs are a triple edge and the triangle (K_3).
The a(4) = 3 graphs are a quadruple edge, a triangle with one double edge and the square (C_4).
(End)
CROSSREFS
Row sums of A339160.
A002218 counts unlabeled 2-connected graphs.
A013922 counts labeled 2-connected graphs.
A322140 is a labeled version.
Sequence in context: A099968 A291401 A331875 * A190166 A238823 A002995
KEYWORD
nonn,more
EXTENSIONS
Name changed by Andrew Howroyd, Dec 05 2020
a(11)-a(20) added using geng/multig from nauty by Andrew Howroyd, Dec 05 2020
a(21)-a(23) from Sean A. Irvine, Apr 18 2024
STATUS
approved