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!)
A187927 Number of embeddings on the sphere of 2-connected planar graphs, minimum vertex degree 3, with n nodes. 1
2, 13, 163, 2067, 30953, 486674, 7957459, 133344454, 2280001754, 39648557743, 699731146514, 12511186297320 (list; graph; refs; listen; history; text; internal format)
OFFSET
6,1
COMMENTS
The graphs are exactly 2-connected, not at least 2-connected. The graphs were enumerated using plantri (by B.D. McKay & G. Brinkmann) for the purpose of finding compound perfect squared squares.
LINKS
Gunnar Brinkmann and Brendan McKay, Plantri Guide
Gunnar Brinkmann and Brendan McKay, Guide to using plantri [Cached copy, with permission]
PROG
(plantri) plantri -p -c2 -m3 -x -u -v n ; or
CROSSREFS
Sequence in context: A192563 A014507 A132614 * A252766 A098638 A090643
KEYWORD
nonn,more,hard
AUTHOR
Stuart E Anderson, Mar 16 2011
EXTENSIONS
a(15)-a(17) from Lorenz Milla, Oct 08 2013
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 April 24 03:08 EDT 2024. Contains 371918 sequences. (Running on oeis4.)