|
%I M3743 #19 Sep 20 2019 04:44:38
%S 1,0,1,1,5,5,21,40,176,500,2053,7532,31206,124552,521332,2167599,
%T 9183879,38965327,166956753,718004565,3107450143,13502835176,
%U 58956369552,258398671525
%N Number of bipartite polyhedral graphs with n nodes.
%D M. B. Dillencourt, Polyhedra of small orders and their Hamiltonian properties. Tech. Rep. 92-91, Info. and Comp. Sci. Dept., Univ. Calif. Irvine, 1992.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Gunnar Brinkmann and Brendan McKay, <a href="http://users.cecs.anu.edu.au/~bdm/plantri/">plantri and fullgen</a> programs for generation of certain types of planar graph.
%H Gunnar Brinkmann and Brendan McKay, <a href="/A000103/a000103_1.pdf">plantri and fullgen</a> programs for generation of certain types of planar graph [Cached copy, pdf file only, no active links, with permission]
%H CombOS - Combinatorial Object Server, <a href="http://combos.org/plantri">generate planar graphs</a>
%H M. B. Dillencourt, <a href="http://dx.doi.org/10.1006/jctb.1996.0008">Polyhedra of small orders and their Hamiltonian properties</a>, Journal of Combinatorial Theory, Series B, Volume 66, Issue 1, January 1996, Pages 87-122.
%o (bash/plantri) for n in {8..25}; do plantri -bpu ${n}; done # - _Sean A. Irvine_, Apr 29 2016
%K nonn
%O 8,5
%A _N. J. A. Sloane_.
%E a(23)-a(31) computed using plantri by _Sean A. Irvine_, Apr 29 2016
|
