login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A199676 Number of minimally 3-connected non-isomorphic graphs on n vertices. 0
1, 1, 3, 5, 18, 57, 285, 1513, 9824, 69536, 540622, 4494676 (list; graph; refs; listen; history; text; internal format)
OFFSET

4,3

LINKS

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

J. P. Costalonga, R. J. Kingan, and S. R. Kingan, Constructing minimally 3-connected graphs, arXiv:2012.12059 [math.CO], 2020-2021; Algorithms 14, no. 1: 9.

Jens M. Schmidt, Combinatorial data.

David Kofoed Wind, Connected Graphs with Fewest Spanning Trees, Bachelor Thesis, Spring 2011.

CROSSREFS

Cf. A006290, A204198, A324418, A338511.

Sequence in context: A011964 A123793 A196420 * A303684 A022489 A176749

Adjacent sequences:  A199673 A199674 A199675 * A199677 A199678 A199679

KEYWORD

nonn,hard,more

AUTHOR

N. J. A. Sloane, Nov 09 2011

EXTENSIONS

a(12) given by Jens M. Schmidt, Feb 27 2019

a(13)-a(15) from Jens M. Schmidt's web page, Jan 10 2021

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 25 23:28 EDT 2021. Contains 348256 sequences. (Running on oeis4.)