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-1 of 1 results.

A243321 Number of simple connected graphs with n nodes that are bipartite and planar.

Original entry on oeis.org

1, 1, 1, 3, 5, 16, 41, 158, 582, 2749, 13852, 80341, 503582, 3419670, 24533162, 184227017
Offset: 1

Views

Author

Travis Hoppe and Anna Petrone, Jun 03 2014

Keywords

Crossrefs

Cf. A003216 (bipartite graphs), A003094 (planar graphs).

Programs

  • Mathematica
    A164099 = Cases[Import["https://oeis.org/A164099/b164099.txt", "Table"], {, }][[All, 2]];
    (* EulerInvTransform is defined in A022562 *)
    EulerInvTransform[{0} ~Join~ A164099 + 1] (* Jean-François Alcover, Dec 03 2019, updated Mar 17 2020 *)

Formula

Inverse Euler transform of (A164099 + 1). - Falk Hüffner, May 10 2019

Extensions

a(11)-a(16) added using tinygraph by Falk Hüffner, May 10 2019
Showing 1-1 of 1 results.