A007111 Number of unlabeled graphs with n nodes and degree >= 3. (Formerly M3060)

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

Offset

0,6

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.

Sequence in context: A354319 A324226 A007112 * A346385 A113013 A307489

Adjacent sequences: A007108 A007109 A007110 * A007112 A007113 A007114

Keyword

nonn

Author

N. J. A. Sloane.

Status

approved