Search: id:A000719 Results 1-1 of 1 results found. %I A000719 M1452 N0574 %S A000719 0,0,1,2,5,13,44,191,1229,13588,288597,12297299,1031342116,166123498733, %T A000719 50668194387427,29104827043066808,31455591302381718651, %U A000719 64032471448906164191208,245999896712611657677614268 %N A000719 Number of disconnected graphs with n nodes. %D A000719 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %D A000719 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence). %D A000719 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 A000719 F. Harary, The number of linear, directed, rooted and connected graphs, Trans. Amer. Math. Soc., 78 (1955), 445-463. %D A000719 R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998. %H A000719 David Wasserman, Table of n, a(n) for n = 0..30 %H A000719 Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics. %H A000719 Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics. %H A000719 Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics. %Y A000719 Equals (A000088) minus (A001349). %Y A000719 Sequence in context: A114297 A119533 A066740 this_sequence A149875 A085632 A111563 %Y A000719 Adjacent sequences: A000716 A000717 A000718 this_sequence A000720 A000721 A000722 %K A000719 nonn,easy,nice %O A000719 0,4 %A A000719 N. J. A. Sloane (njas(AT)research.att.com). %E A000719 More terms from Christian Bower (bowerc(AT)usa.net). Further terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 14 2000. Search completed in 0.001 seconds