login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007028 Number of bipartite polyhedral graphs with n nodes.
(Formerly M3743)
1
1, 0, 1, 1, 5, 5, 21, 40, 176, 500, 2053, 7532, 31206, 124552, 521332, 2167599, 9183879, 38965327, 166956753, 718004565, 3107450143, 13502835176, 58956369552, 258398671525 (list; graph; refs; listen; history; text; internal format)
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
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.
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
KEYWORD
nonn
AUTHOR
EXTENSIONS
a(23)-a(31) computed using plantri by Sean A. Irvine, Apr 29 2016
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 05:48 EDT 2024. Contains 371265 sequences. (Running on oeis4.)