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.

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

This page as a plain text file.
%I A243321 #20 Mar 17 2020 10:17:36
%S A243321 1,1,1,3,5,16,41,158,582,2749,13852,80341,503582,3419670,24533162,
%T A243321 184227017
%N A243321 Number of simple connected graphs with n nodes that are bipartite and planar.
%H A243321 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>
%H A243321 T. Hoppe and A. Petrone, <a href="http://arxiv.org/abs/1408.3644">Integer sequence discovery from small graphs</a>, arXiv preprint arXiv:1408.3644 [math.CO], 2014.
%H A243321 F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version 9766535.
%F A243321 Inverse Euler transform of (A164099 + 1). - _Falk Hüffner_, May 10 2019
%t A243321 A164099 = Cases[Import["https://oeis.org/A164099/b164099.txt", "Table"], {_, _}][[All, 2]];
%t A243321 (* EulerInvTransform is defined in A022562 *)
%t A243321 EulerInvTransform[{0} ~Join~ A164099 + 1] (* Jean-François Alcover, Dec 03 2019, updated Mar 17 2020 *)
%Y A243321 Cf. A003216 (bipartite graphs), A003094 (planar graphs).
%K A243321 nonn,more
%O A243321 1,4
%A A243321 _Travis Hoppe_ and _Anna Petrone_, Jun 03 2014
%E A243321 a(11)-a(16) added using tinygraph by _Falk Hüffner_, May 10 2019