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

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

Offset: 1

Author

Travis Hoppe and Anna Petrone, Jun 03 2014

Keywords

• nonn
• more

Links

• Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs
• T. Hoppe and A. Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644 [math.CO], 2014.
• F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version 9766535.

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