%I A000287 M3290 N1326
%S A000287 1,0,4,6,24,66,214,676,2209,7296,24460,82926,284068,981882,3421318,
%T A000287 12007554,42416488,150718770,538421590,1932856590,6969847486
%N A000287 Number of rooted polyhedral graphs with n edges.
%D A000287 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A000287 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 
               (includes this sequence).
%D A000287 A. J. W. Duijvestijn and P. J. Federico, The number of polyhedral (3-connected 
               planar) graphs. Math. Comp. 37 (1981), no. 156, 523-532.
%D A000287 Handbook of Combinatorics, North-Holland '95, p. 892. (Gives different 
               last term)
%D A000287 W. T. Tutte, A new branch of enumerative graph theory, Bull. Amer. Math. 
               Soc., 68 (1962), 500-504.
%D A000287 W. T. Tutte, A census of planar maps, Canad. J. Math., 15 (1963), 249-271.
%Y A000287 Cf. A000256.
%Y A000287 Sequence in context: A034458 A067001 A057343 this_sequence A032087 A165164 
               A136591
%Y A000287 Adjacent sequences: A000284 A000285 A000286 this_sequence A000288 A000289 
               A000290
%K A000287 nonn,nice
%O A000287 6,3
%A A000287 N. J. A. Sloane (njas(AT)research.att.com), Simon Plouffe (simon.plouffe(AT)gmail.com)