A007028 Number of bipartite polyhedral graphs with n nodes. (Formerly M3743)

1, 0, 1, 1, 5, 5, 21, 40, 176, 500, 2053, 7532, 31206, 124552, 521332, 2167599, 9183879, 38965327, 166956753, 718004565, 3107450143, 13502835176, 58956369552, 258398671525

Offset

8,5

References

M. B. Dillencourt, Polyhedra of small orders and their Hamiltonian properties. Tech. Rep. 92-91, Info. and Comp. Sci. Dept., Univ. Calif. Irvine, 1992.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

Table of n, a(n) for n=8..31.

Gunnar Brinkmann and Brendan McKay, plantri and fullgen programs for generation of certain types of planar graph.

Gunnar Brinkmann and Brendan McKay, plantri and fullgen programs for generation of certain types of planar graph [Cached copy, pdf file only, no active links, with permission]

CombOS - Combinatorial Object Server, generate planar graphs

M. B. Dillencourt, Polyhedra of small orders and their Hamiltonian properties, Journal of Combinatorial Theory, Series B, Volume 66, Issue 1, January 1996, Pages 87-122.

Iva Kodrnja and Helena Koncul, Number of Polynomials Vanishing on a Basis of S_m(Gamma_0(N)), arXiv:2405.10747 [math.NT], 2024. See p. 10.

Prog

(bash/plantri) for n in {8..25}; do plantri -bpu ${n}; done # - Sean A. Irvine, Apr 29 2016

Crossrefs

Sequence in context: A147254 A241864 A243121 * A318960 A097336 A365104

Adjacent sequences: A007025 A007026 A007027 * A007029 A007030 A007031

Keyword

nonn

Author

N. J. A. Sloane.

Extensions

a(23)-a(31) computed using plantri by Sean A. Irvine, Apr 29 2016

Status

approved