Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #20 Mar 17 2020 10:17:36
%S 1,1,1,3,5,16,41,158,582,2749,13852,80341,503582,3419670,24533162,
%T 184227017
%N Number of simple connected graphs with n nodes that are bipartite and planar.
%H Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>
%H 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 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 Inverse Euler transform of (A164099 + 1). - _Falk Hüffner_, May 10 2019
%t A164099 = Cases[Import["https://oeis.org/A164099/b164099.txt", "Table"], {_, _}][[All, 2]];
%t (* EulerInvTransform is defined in A022562 *)
%t EulerInvTransform[{0} ~Join~ A164099 + 1] (* Jean-François Alcover, Dec 03 2019, updated Mar 17 2020 *)
%Y Cf. A003216 (bipartite graphs), A003094 (planar graphs).
%K nonn,more
%O 1,4
%A _Travis Hoppe_ and _Anna Petrone_, Jun 03 2014
%E a(11)-a(16) added using tinygraph by _Falk Hüffner_, May 10 2019