A054316 Number of unlabeled 2-connected 3-edge-connected graphs with n nodes.

1, 3, 19, 149, 2578, 84127, 5201474, 577043450, 113371887160, 39618007594177, 24916462201698733, 28563626901315427552, 60366734333061918085970, 237406975833857522512566844, 1750330441805919888169149998870

Offset

4,2

Links

Table of n, a(n) for n=4..18.

S. K. Pootheri, Counting classes of labeled 2-connected graphs, M.S. Dissertation, University of Georgia, 2000.

S. K. Pootheri, Counting classes of labeled 2-connected graphs, M.S. Thesis, University of Georgia, 2000. [Local copy]

S. K. Pootheri, Characterizing and counting classes of unlabeled 2-connected graphs, Ph. D. Dissertation, University of Georgia, 2000.

S. K. Pootheri, Characterizing and counting classes of unlabeled 2-connected graphs, Ph. D. Dissertation, University of Georgia, 2000. [Local copy]

Crossrefs

Cf. A054317, A003317.

Sequence in context: A005258 A131551 A074546 * A006289 A120590 A354319

Adjacent sequences: A054313 A054314 A054315 * A054317 A054318 A054319

Keyword

hard,nice,nonn

Author

Sridar K. Pootheri (sridar(AT)math.uga.edu), Feb 25 2000

Status

approved