Search: id:A003094
Results 1-1 of 1 results found.
%I A003094 M1652
%S A003094 1,1,1,2,6,20,99,646,5974,71885,1052805,17449299
%N A003094 Number of unlabeled connected planar simple graphs with n nodes.
%D A003094 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences,
Academic Press, 1995 (includes this sequence).
%D A003094 P. Steinbach, Field Guide to Simple Graphs. Design Lab, Albuquerque NM,
1990.
%D A003094 R. J. Wilson, Introduction to Graph Theory. Academic Press, NY, 1972,
p. 162.
%H A003094 David Wasserman, Table of n, a(n) for n = 0..11
a>
%H A003094 E. Friedman, Illustration of small graphs
%H A003094 N. J. A. Sloane, Transforms
%H A003094 Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
a>
%e A003094 a(3)=2 since the path o-o-o and the triangle are the two connected planar
simple graphs on three nodes.
%Y A003094 Inverse Euler transform of A005470 - Christian G. Bower (bowerc(AT)usa.net)
%Y A003094 Cf. A126201.
%Y A003094 Sequence in context: A020095 A026991 A049379 this_sequence A073964 A079457
A079455
%Y A003094 Adjacent sequences: A003091 A003092 A003093 this_sequence A003095 A003096
A003097
%K A003094 nonn,nice,hard,core
%O A003094 0,4
%A A003094 N. J. A. Sloane (njas(AT)research.att.com).
%E A003094 More terms from Brendan McKay (bdm(AT)cs.anu.edu.au)
Search completed in 0.001 seconds