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.

Showing 1-2 of 2 results.

A372853 Numbers of uniquely embeddable planar connected graphs on n vertices.

Original entry on oeis.org

1, 1, 2, 6, 15, 51, 206, 1297, 11742, 143095, 2056120, 32337106
Offset: 1

Views

Author

Eric W. Weisstein, May 15 2024

Keywords

Comments

Uniquely embeddable graphs have a unique dual.
Computed by Stan Wagon up to n=7 and Brendan McKay up to n=12.

Links

Crossrefs

Cf. A372854 (maximum numbers of planar embeddings).

A372892 Total number of unlabeled simple maps on the sphere with n vertices.

Original entry on oeis.org

1, 1, 2, 6, 25, 179, 2014, 31178, 580555, 12046072, 267836680, 6258809085, 151983244000, 3807081193879
Offset: 1

Views

Author

Eric W. Weisstein, May 19 2024

Keywords

Comments

Computed by Brendan McKay.
a(n) is the same as the total number of distinct spherical drawings of connected graphs with n vertices.

Links

Crossrefs

Row sums of A384963, column sums of A384850.
Cf. A372853 (uniquely embeddable connected graphs).
Cf. A372854 (largest numbers of planar embeddings for connected graphs).
Cf. A006395 (with n edges), A384965 (sensed version).

Extensions

a(14) added by Andrew Howroyd, Jun 13 2025
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.