

A086216


Number of 4connected unlabeled nnode graphs.


2




OFFSET

1,6


COMMENTS

The definition means that the connectivity is 4 or more.


LINKS

Table of n, a(n) for n=1..10.
T. Hoppe and A. Petrone,Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644, 2014
Eric Weisstein's World of Mathematics, kConnected Graph


EXAMPLE

There are 4 different 4connected graphs on 6 vertices.  Dylan Thurston, Jun 18 2009


CROSSREFS

See A052445 for another (apparently incorrect, as of Jul 08 2015) version.
See A259862 for further information.
Sequence in context: A259591 A093959 A222902 * A167041 A123129 A075577
Adjacent sequences: A086213 A086214 A086215 * A086217 A086218 A086219


KEYWORD

nonn,hard,more


AUTHOR

Eric W. Weisstein, Jul 12 2003


EXTENSIONS

Offset corrected by Dylan Thurston, Jun 18 2009.
a(10) from the Encyclopedia of Finite Graphs (Travis Hoppe and Anna Petrone), Apr 11 2014
Minor edits by N. J. A. Sloane, Jul 08 2015 at the suggestion of Brendan McKay. a(11) could be obtained from the data in A259862.


STATUS

approved



