login
This site is supported by donations 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

Reference also contains the edge breakups for each term.

REFERENCES

Sridar K. Pootheri, Characterizing and counting classes of unlabeled 2-connected graphs, Ph.D. Dissertation, University of Georgia. (Under the direction of Robert W. Robinson, rwr(AT)cs.uga.edu)

LINKS

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

CROSSREFS

Cf. A054316, A003317, A001072.

Sequence in context: A064236 A245001 A007569 * A065840 A181934 A093785

Adjacent sequences:  A054314 A054315 A054316 * A054318 A054319 A054320

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 | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified February 23 21:23 EST 2018. Contains 299588 sequences. (Running on oeis4.)