login
This site is supported by donations to The OEIS Foundation.

 

Logo

"Email this user" was broken Aug 14 to 9am Aug 16. If you sent someone a message in this period, please send it again.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007027 Number of 4-connected polyhedral graphs with n nodes.
(Formerly M3402)
0
1, 0, 1, 1, 4, 10, 53, 292, 2224, 18493, 167504, 1571020 (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

Table of n, a(n) for n=4..15.

CROSSREFS

Sequence in context: A032495 A109387 A018844 * A192444 A197902 A276123

Adjacent sequences:  A007024 A007025 A007026 * A007028 A007029 A007030

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified August 18 12:18 EDT 2017. Contains 290720 sequences.