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.

A126201 Number of rooted connected unlabeled planar graphs on n nodes.

Original entry on oeis.org

1, 1, 3, 11, 57, 375, 3398, 40043, 585440, 9895493
Offset: 1

Views

Author

David Applegate and N. J. A. Sloane, Mar 09 2007

Keywords

Comments

Number of "pointed" connected planar graphs on n nodes: number of pairs (G,P) where G is a connected unlabeled planar graph with n nodes and P runs through the orbit representatives of nodes in G under the action of Aut(G).
For n <= 4 this agrees with A126100; a(5) = A126100(5) - 1 = 57, since K_5 is the only excluded graph on 5 nodes.

Crossrefs

Extensions

a(6)-a(10) from Brendan McKay, Mar 10 2007