%I A006290 M3039
%S A006290 1,3,17,136,2388,80890,5114079,573273505,113095167034,39582550575765,
%T A006290 24908445793058442,28560405143495819079,60364410130177223014724,237403933018799958309530349,
%U A006290 1750323137355778190158082029500,24333358813699371350715221107464003,640811613278752754485012443963579501421
%N A006290 Number of 3-connected graphs with n nodes.
%D A006290 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A006290 R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.
%D A006290 R. W. Robinson and T. R. S. Walsh, Inversion of cycle index sum relations 
               for 2- and 3-connected graphs. J. Combin. Theory Ser. B 57 (1993), 
               no. 2, 289-308.
%D A006290 T. R. S. Walsh, Counting unlabeled three-connected and homeomorphically 
               irreducible two-connected graphs. J. Combin. Theory Ser. B 32 (1982), 
               no. 1, 12-32.
%H A006290 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               k-ConnectedGraph.html">k-Connected Graph</a>
%H A006290 R. W. Robinson, <a href="http://www.cs.uga.edu/~rwr/publications/tables.pdf">
               Tables</a>
%H A006290 R. W. Robinson and T. R. S. Walsh, <a href="http://www.cs.uga.edu/~rwr/
               publications/cycleindex.pdf">Inversion of cycle index sum relations 
               for 2- and 3-connected graphs</a>, J. Combin. Theory Ser. B. 57 (1993), 
               289-308.
%Y A006290 Cf. A000088, A001349, A002218, A006289.
%Y A006290 Sequence in context: A093986 A055214 A105630 this_sequence A060003 A025167 
               A136727
%Y A006290 Adjacent sequences: A006287 A006288 A006289 this_sequence A006291 A006292 
               A006293
%K A006290 nonn,nice,easy
%O A006290 4,2
%A A006290 N. J. A. Sloane (njas(AT)research.att.com).
%E A006290 More terms from R. C. Read (rcread(AT)math.uwaterloo.ca). Robinson and 
               Walsh list first 25 terms.