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

%I A001349 M1657 N0649
%S A001349 1,1,1,2,6,21,112,853,11117,261080,11716571,1006700565,164059830476,
%T A001349 50335907869219,29003487462848061,31397381142761241960,63969560113225176176277,
%U A001349 245871831682084026519528568,1787331725248899088890200576580,24636021429399867655322650759681644
%N A001349 Number of connected graphs with n nodes.
%C A001349 Inverse Euler transform of A000088.
%D A001349 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A001349 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 
               (includes this sequence).
%D A001349 P. Butler and R. W. Robinson, On the computer calculation of the number 
               of nonseparable graphs, pp. 191 - 208 of Proc. Second Caribbean Conference 
               Combinatorics and Computing (Bridgetown, 1977). Ed. R. C. Read and 
               C. C. Cadogan. University of the West Indies, Cave Hill Campus, Barbados, 
               1977. vii+223 pp.
%D A001349 P. J. Cameron, Some sequences of integers, Discrete Math., 75 (1989), 
               89-102; also in "Graph Theory and Combinatorics 1988", ed. B. Bollobas, 
               Annals of Discrete Math., 43 (1989), 89-102.
%D A001349 F. Harary, The number of linear, directed, rooted and connected graphs, 
               Trans. Amer. Math. Soc., 78 (1955), 445-463.
%D A001349 F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 
               1973, page 48, c(x). Also page 242.
%D A001349 M. Petkovsek and T. Pisanski, Counting disconnected structures: chemical 
               trees, fullerenes, I-graphs and others, Croatica Chem. Acta, 78 (2005), 
               563-567.
%D A001349 R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.
%D A001349 R. W. Robinson, Enumeration of non-separable graphs, J. Combin. Theory 
               9 (1970), 327-356.
%D A001349 R. W. Robinson, Numerical implementation of graph counting algorithms, 
               AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1978.
%D A001349 M. L. Stein and P. R. Stein, Enumeration of Linear Graphs and Connected 
               Linear Graphs up to p = 18 Points. Report LA-3775, Los Alamos Scientific 
               Laboratory of the University of California, Los Alamos, NM, Oct 1967.
%D A001349 Robin J. Wilson, Introduction to Graph Theory, Academic Press, 1972. 
               (But see A126060!)
%D A001349 A. Milicevic and N. Trinajstic, "Combinatorial Enumeration in Chemistry", 
               Chem. Modell., Vol. 4, (2006), pp. 405-469.
%H A001349 N. J. A. Sloane, <a href="b001349.txt">Table of n, a(n) for n = 0..75</
               a> [Computed using Keith Briggs's values for A000088]
%H A001349 P. J. Cameron, <a href="http://www.cs.uwaterloo.ca/journals/JIS/index.html">
               Sequences realized by oligomorphic permutation groups</a>, J. Integ. 
               Seqs. Vol. 3 (2000), #00.1.5.
%H A001349 E. Friedman, <a href="a000088a.gif">Illustration of small graphs</a>
%H A001349 Gordon Royle, <a href="http://units.maths.uwa.edu.au/~gordon/graphs">
               Small graphs</a>
%H A001349 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               ConnectedGraph.html">Connected Graph.</a>
%H A001349 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               k-ConnectedGraph.html">k-Connected Graph</a>
%H A001349 <a href="Sindx_Cor.html#core">Index entries for "core" sequences</a>
%Y A001349 Cf. A000088, A002218, A006290, A000719. Row sums of A054924.
%Y A001349 Sequence in context: A076328 A128527 A128528 this_sequence A126060 A110306 
               A028936
%Y A001349 Adjacent sequences: A001346 A001347 A001348 this_sequence A001350 A001351 
               A001352
%K A001349 nonn,core,nice
%O A001349 0,4
%A A001349 N. J. A. Sloane (njas(AT)research.att.com).
%E A001349 More terms from R. C. Read (rcread(AT)math.uwaterloo.ca).
%E A001349 Link fixed by Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Oct 
               23 2009

Search completed in 0.002 seconds