%I #10 Jan 17 2020 03:30:20
%S 1,1,4,6,28,77,386,1787,10354,62040,404093,2725484,19078248
%N Number of pairwise non-isomorphic biconnected planar bipartite graphs on n vertices.
%C Biconnected means "at least 2-connected". The corresponding sequence for 3-connected bipartite planar graph is A007028, where the term "polyhedral graph" is used as shorthand for "3-connected planar graph".
%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.
%e a(4) = 1 because the 4-cycle is the only planar and bipartite graph on 4 vertices that is at least 2-connected and a(5) = 1 because the complete bipartite graph K2,3 is the only such graph on 5 vertices.
%Y Cf. A007028.
%K nonn,more
%O 4,3
%A _Gordon F. Royle_, Oct 18 2006
%E a(15)-a(16) added using tinygraph by _Falk Hüffner_, May 09 2019