A007112 Number of connected unlabeled graphs with n nodes and degree >= 3.

0, 0, 0, 1, 3, 19, 150, 2589, 84242, 5203110, 577076528, 113373005661, 39618075274687, 24916469690421103, 28563628406172313565, 60366734880279992689057, 237406976195431811992516687, 1750330442243433249473074447457, 24333391254830431938389159467111420, 640811881795531742198398521689947259687

Offset: 1

Author

N. J. A. Sloane

Keywords

• nonn
• nice

References

• R. W. Robinson, personal communication.
• R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1976.
• N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

• R. W. Robinson, Table of n, a(n) for n = 1..28
• Eric Weisstein's World of Mathematics, Connected Graph.
• Eric Weisstein's World of Mathematics, Minimum Vertex Degree.

Crossrefs

Row sums of A123545.