|
Search: id:A002840
|
|
|
| A002840 |
|
Number of polyhedral graphs with n edges.
(Formerly M0339 N0129)
|
|
+0
4
|
|
| 1, 0, 1, 2, 2, 4, 12, 22, 58, 158, 448, 1342, 4199, 13384, 43708, 144810, 485704, 1645576, 5623571, 19358410, 67078828, 233800162, 819267086, 2884908430
(list; graph; listen)
|
|
|
OFFSET
|
6,4
|
|
|
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.
Duijvestijn, A. J. W.; Federico, P. J.; The number of polyhedral (3-connected planar) graphs. Math. Comp. 37 (1981), no. 156, 523-532.
P. J. Federico, Enumeration of polyhedra: the number of 9-hedra, J. Combin. Theory, 7 (1969), 155-161.
T. R. S. Walsh, personal communication.
|
|
LINKS
|
G. P. Michon, Counting Polyhedra
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
CROSSREFS
|
Cf. A002841, A000944.
Adjacent sequences: A002837 A002838 A002839 this_sequence A002841 A002842 A002843
Sequence in context: A112362 A134720 A019225 this_sequence A007181 A100238 A098774
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
