|
| |
|
|
A001433
|
|
Number of graphs with n nodes and n-1 edges.
(Formerly M2588 N1024)
|
|
3
| |
|
|
1, 1, 1, 3, 6, 15, 41, 115, 345, 1103, 3664, 12763, 46415, 175652, 691001, 2821116, 11932174, 52211412, 236007973, 1100528508, 5287050500, 26134330813, 132760735671, 692294900849, 3701754158688
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,4
|
|
|
REFERENCES
| J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 146.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
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.
|
|
|
MATHEMATICA
| (* first do *) Needs["Combinatorica`"] (* then *) Table[ NumberOfGraphs[n, n-1], {n, 1, 25}] (* RGWv *)
|
|
|
CROSSREFS
| Cf. A008406.
Sequence in context: A098701 A152799 A140824 * A005368 A067771 A056382
Adjacent sequences: A001430 A001431 A001432 * A001434 A001435 A001436
|
|
|
KEYWORD
| nonn,easy,nice
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
EXTENSIONS
| More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Jan 15 2000
|
| |
|
|
