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!)
A054316 Number of unlabeled 2-connected 3-edge-connected graphs with n nodes. 4
1, 3, 19, 149, 2578, 84127, 5201474, 577043450, 113371887160, 39618007594177, 24916462201698733, 28563626901315427552, 60366734333061918085970, 237406975833857522512566844, 1750330441805919888169149998870 (list; graph; refs; listen; history; text; internal format)
OFFSET
4,2
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: A005258 A131551 A074546 * A006289 A120590 A354319
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 22:52 EDT 2024. Contains 374323 sequences. (Running on oeis4.)