|
Search: id:A000287
|
|
|
| A000287 |
|
Number of rooted polyhedral graphs with n edges.
(Formerly M3290 N1326)
|
|
+0
2
|
|
| 1, 0, 4, 6, 24, 66, 214, 676, 2209, 7296, 24460, 82926, 284068, 981882, 3421318, 12007554, 42416488, 150718770, 538421590, 1932856590, 6969847486
(list; graph; listen)
|
|
|
OFFSET
|
6,3
|
|
|
REFERENCES
|
A. J. W. Duijvestijn and P. J. Federico, The number of polyhedral (3-connected planar) graphs. Math. Comp. 37 (1981), no. 156, 523-532.
Handbook of Combinatorics, North-Holland '95, p. 892. (Gives different last term)
W. T. Tutte, A new branch of enumerative graph theory, Bull. Amer. Math. Soc., 68 (1962), 500-504.
W. T. Tutte, A census of planar maps, Canad. J. Math., 15 (1963), 249-271.
|
|
CROSSREFS
|
Cf. A000256.
Adjacent sequences: A000284 A000285 A000286 this_sequence A000288 A000289 A000290
Sequence in context: A034458 A067001 A057343 this_sequence A032087 A136591 A009459
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
njas, Simon Plouffe (plouffe(AT)math.uqam.ca)
|
|
|
Search completed in 0.002 seconds
|
