A086217 Number of 5-connected graphs on n nodes.

1, 4, 39, 1051, 102630, 22331311

Offset

6,2

Links

Table of n, a(n) for n=6..11.

Travis Hoppe and Anna Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644 [math.CO], 2014.

Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs

Jens M. Schmidt, Data files in graph6 format

Eric Weisstein's World of Mathematics, k-Connected Graph

Formula

a(n) = A324240(n) + A324234(n). - Andrew Howroyd, Sep 04 2019

a(n) = A086216(n) - A052445(n). - Jean-François Alcover, Sep 13 2019, after Andrew Howroyd in A086216

Crossrefs

Cf. A002218, A052443, A052445, A086216, A259862, A324234, A324240.

Sequence in context: A165434 A348118 A341473 * A203197 A094156 A266859

Adjacent sequences: A086214 A086215 A086216 * A086218 A086219 A086220

Keyword

nonn,hard,more

Author

Eric W. Weisstein, Jul 12 2003

Extensions

Offset corrected by Travis Hoppe, Apr 11 2014

a(10) from the Encyclopedia of Finite Graphs (Travis Hoppe and Anna Petrone), Apr 11 2014

a(11) by Jens M. Schmidt, Feb 20 2019

Status

approved