Search: id:A005470
Results 1-1 of 1 results found.

%I A005470 M1252
%S A005470 1,1,2,4,11,33,142,822,6966,79853,1140916,18681008
%N A005470 Number of unlabeled planar simple graphs with n nodes.
%C A005470 Euler transform of A003094 - Christian G. Bower (bowerc(AT)usa.net)
%D A005470 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A005470 P. Steinbach, Field Guide to Simple Graphs. Design Lab, Albuquerque NM, 
               1990.
%D A005470 W. T. Trotter, ed., Planar Graphs, Vol. 9, DIMACS Series in Discrete 
               Mathematics and Theoretical Computer Science, Amer. Math. Soc., 1993.
%D A005470 R. J. Wilson, Introduction to Graph Theory. Academic Press, NY, 1972, 
               p. 162.
%H A005470 David Wasserman, <a href="b005470.txt">Table of n, a(n) for n = 1..11</
               a>
%H A005470 E. Friedman, <a href="a000088a.gif">Illustration of small graphs</a>
%H A005470 N. J. A. Sloane, <a href="transforms.txt">Transforms</a>
%H A005470 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               PlanarGraph.html">Link to a section of The World of Mathematics.</
               a>
%H A005470 <a href="Sindx_Cor.html#core">Index entries for "core" sequences</a>
%e A005470 a(2)=2 since o o and o-o are the two planar simple graphs on two nodes.
%Y A005470 Cf. A003094 (connected planar graphs), A034889, A039735 (planar graphs 
               by nodes and edges).
%Y A005470 Cf. A126201.
%Y A005470 Sequence in context: A123469 A123448 A039707 this_sequence A123471 A123416 
               A123406
%Y A005470 Adjacent sequences: A005467 A005468 A005469 this_sequence A005471 A005472 
               A005473
%K A005470 nonn,core,nice,hard
%O A005470 0,3
%A A005470 N. J. A. Sloane (njas(AT)research.att.com).
%E A005470 n=8 term corrected and n=9..11 terms calculated by Brendan McKay (bdm(AT)cs.anu.edu.au)
%E A005470 Terms a(0) - a(10) confirmed by David Applegate (david(AT)research.att.com) 
               and N. J. A. Sloane (njas(AT)research.att.com), Mar 09 2007

Search completed in 0.002 seconds