A054594 Number of labeled minimally 2-connected graphs by nodes.

1, 3, 22, 255, 3951, 76468, 1773108, 48018645, 1488656845, 51989095026, 2019934308294, 86440374376447, 4040615973961035, 204882667497974040, 11202622636253431336, 657174516317371860777, 41178215707421481322713

Offset

3,2

Links

Table of n, a(n) for n=3..19.

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. A003317.

Sequence in context: A361097 A143634 A054595 * A242794 A367181 A005264

Adjacent sequences: A054591 A054592 A054593 * A054595 A054596 A054597

Keyword

nice,nonn

Author

Sridar K. Pootheri (sridar(AT)math.uga.edu), Apr 14 2000

Status

approved