%I M2224 #17 Oct 09 2017 02:17:02
%S 0,0,0,0,0,0,0,1,0,0,1,3,1,5,4,11,20,46,89,243,525,1359,3316
%N Number of unlabeled trivalent 3-connected bipartite planar graphs with 2n nodes without subgraphs R1 and R4.
%C The graphs R1 and R4 are given on p. 281 of Holton. - _Sean A. Irvine_, Oct 09 2017
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H D. A. Holton et al., <a href="http://dx.doi.org/10.1016/0095-8956(85)90072-3">Hamiltonian cycles in cubic 3-connected bipartite planar graphs</a>, J. Combin. Theory, B 38 (1985), 279-297.
%Y Cf. A007083.
%K nonn,more
%O 2,12
%A _N. J. A. Sloane_, _Mira Bernstein_
%E Title improved and a(20)-a(24) from _Sean A. Irvine_, Oct 09 2017