A005644 Number of labeled 3-connected graphs with n nodes. (Formerly M5190)

1, 26, 1768, 225096, 51725352, 21132802544, 15463799747936, 20604021770403328, 50928019401158515328, 237644423948928994197504, 2125373296900166452199861760, 36884133903194627014531723872256

Offset

4,2

References

Miklos Bona, editor, Handbook of Enumerative Combinatorics, CRC Press, 2015, p. 403.

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 = 4..25

T. R. S. Walsh, Counting labeled three-connected and homeomorphically irreducible two-connected graphs, J. Combin. Theory Ser. B 32 (1982), no. 1, 1-11.

Crossrefs

Row sums of A123542.

Sequence in context: A368852 A300578 A217228 * A123537 A220503 A054597

Adjacent sequences: A005641 A005642 A005643 * A005645 A005646 A005647

Keyword

nonn

Author

N. J. A. Sloane.

Extensions

Corrected and extended by N. J. A. Sloane, Nov 13 2006

Status

approved