cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A187927 Number of embeddings on the sphere of 2-connected planar graphs, minimum vertex degree 3, with n nodes.

Original entry on oeis.org

2, 13, 163, 2067, 30953, 486674, 7957459, 133344454, 2280001754, 39648557743, 699731146514, 12511186297320
Offset: 6

Views

Author

Stuart E Anderson, Mar 16 2011

Keywords

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.

Crossrefs

Programs

  • plantri
    plantri -p -c2 -m3 -x -u -v n  ; or

Extensions

a(15)-a(17) from Lorenz Milla, Oct 08 2013