login
This site is supported by donations to The OEIS Foundation.

 

Logo

The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A086217 Number of 5-connected graphs on n nodes. 0
1, 4, 39, 1051, 102630 (list; graph; refs; listen; history; text; internal format)
OFFSET

6,2

LINKS

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

T. Hoppe and A. Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644, 2014

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

CROSSREFS

Sequence in context: A188418 A136653 A165434 * 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

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 May 27 13:30 EDT 2017. Contains 287205 sequences.