A005637 Number of n-node graphs without nodes of degree 2.

1, 1, 2, 2, 5, 10, 45, 284, 3960, 110356, 6153615, 640014800, 120777999811, 41158185726269, 25486682538903526, 28943747337743989421, 60828392582465943631269, 238439312273287947102629832

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, 1978.
• 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
• R. W. Robinson, Cubic graphs (notes)