|
Search: id:A000719
|
|
|
| A000719 |
|
Number of disconnected graphs with n nodes.
(Formerly M1452 N0574)
|
|
+0
5
|
|
| 0, 0, 1, 2, 5, 13, 44, 191, 1229, 13588, 288597, 12297299, 1031342116, 166123498733, 50668194387427, 29104827043066808, 31455591302381718651, 64032471448906164191208, 245999896712611657677614268
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
REFERENCES
|
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.
F. Harary, The number of linear, directed, rooted and connected graphs, Trans. Amer. Math. Soc., 78 (1955), 445-463.
R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.
|
|
LINKS
|
David Wasserman, Table of n, a(n) for n = 0..30
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
CROSSREFS
|
Adjacent sequences: A000716 A000717 A000718 this_sequence A000720 A000721 A000722
Equals (A000088) minus (A001349).
Sequence in context: A114297 A119533 A066740 this_sequence A085632 A111563 A079573
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from Christian Bower (bowerc(AT)usa.net). Further terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Apr 14 2000.
|
|
|
Search completed in 0.002 seconds
|
