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.

A021103 Number of two-connected (or biconnected) planar graphs with n nodes.

Original entry on oeis.org

0, 0, 0, 1, 3, 9, 44, 294, 2893, 36496, 545808, 9029737, 159563559, 2952794985, 56589742050
Offset: 0

Views

Author

Keywords

Comments

For n < 3, conventions vary: Read & Wilson set a(2) = 0, but Gagarin et al. set a(2) = 1. - Andrey Zabolotskiy, Jun 07 2023

References

  • R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998. See p. 229.

Crossrefs

Row sums of A049336.
The labeled version is A096331.
Cf. A000944 (3-connected), A002218, A003094, A005470.

Extensions

a(12)-a(14) from Gilbert Labelle (labelle.gilbert(AT)uqam.ca), Jan 20 2009
Offset 0 from Michel Marcus, Jun 05 2023
a(2) changed back to 0 by Georg Grasegger and Andrey Zabolotskiy, Jun 07 2023