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!)
A007025 Number of polyhedral graphs with n nodes and minimal degree 4.
(Formerly M3487)
0
0, 0, 1, 1, 4, 14, 67, 428, 3515, 31763, 307543, 3064701, 31199068, 322264655, 3369911732, 35611596455, 379881408164, 4086847012014, 44308209298480 (list; graph; refs; listen; history; text; internal format)
OFFSET
4,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, Guide to using plantri
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.
CROSSREFS
Sequence in context: A292724 A292725 A292713 * A221538 A301511 A014512
KEYWORD
nonn,more,hard
AUTHOR
EXTENSIONS
a(16)-a(20) computed with plantri by Sean A. Irvine, Sep 19 2017
a(21)-a(22) computed with plantri by Jan Goedgebeur, Dec 03 2021
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 April 23 06:45 EDT 2024. Contains 371906 sequences. (Running on oeis4.)