login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054317 Number of unlabeled 2-connected minimally 2-edge-connected graphs with n nodes. 5
1, 1, 2, 3, 5, 10, 19, 42, 92, 225, 564, 1501, 4127, 11809, 34713, 104904, 323778, 1019538, 3265502, 10624881, 35065697, 117289911, 397290416, 1362060455, 4724272231, 16572501190, 58782486855, 210782826628, 763991002957 (list; graph; refs; listen; history; text; internal format)
OFFSET
3,3
COMMENTS
References also contain the edge breakups for each term.
LINKS
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
Sequence in context: A245001 A365858 A007569 * A065840 A181934 A093785
KEYWORD
hard,nice,nonn
AUTHOR
Sridar K. Pootheri (sridar(AT)math.uga.edu), Feb 25 2000
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 14 05:06 EDT 2024. Contains 374291 sequences. (Running on oeis4.)