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

0, 0, 0, 0, 1, 3, 19, 150, 2590, 84245, 5203135, 577076735, 113373008891, 39618075369549, 24916469695937480, 28563628406766988588, 60366734880395211775791, 237406976195471782149927759, 1750330442243458287054664072364

Offset: 0

Author

N. J. A. Sloane

Keywords

• nonn

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 = 0..28

Crossrefs

Euler transform of A007112.