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.

A176425 Number of connected planar graphs with at most n edges.

Original entry on oeis.org

1, 2, 3, 6, 11, 23, 53, 132, 359, 1068, 3386, 11435, 40807, 152807, 597662, 2430734, 10237458, 44489603, 198831994, 911063459
Offset: 0

Views

Author

Jonathan Vos Post, Apr 17 2010

Keywords

Comments

Partial sums of number of connected planar graphs with n edges (A046091).

Crossrefs

Formula

a(n) = Sum_{i=0..n} A046091(i).

Extensions

New name from Bartlomiej Pawlik, May 31 2022