This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A007028 M3743 #36 Jul 23 2025 14:36:55
%S A007028 1,0,1,1,5,5,21,40,176,500,2053,7532,31206,124552,521332,2167599,
%T A007028 9183879,38965327,166956753,718004565,3107450143,13502835176,
%U A007028 58956369552,258398671525
%N A007028 Number of bipartite polyhedral graphs with n nodes.
%D A007028 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 A007028 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A007028 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 A007028 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 A007028 CombOS - Combinatorial Object Server, <a href="http://combos.org/plantri">generate planar graphs</a>
%H A007028 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.
%H A007028 Iva Kodrnja and Helena Koncul, <a href="https://arxiv.org/abs/2405.10747">Number of Polynomials Vanishing on a Basis of S_m(Gamma_0(N))</a>, arXiv:2405.10747 [math.NT], 2024. See p. 10.
%o A007028 (plantri) for n in {8..25}; do plantri -bpu ${n}; done # _Sean A. Irvine_, Apr 29 2016
%K A007028 nonn
%O A007028 8,5
%A A007028 _N. J. A. Sloane_
%E A007028 a(23)-a(31) computed using plantri by _Sean A. Irvine_, Apr 29 2016