|
Search: id:A001435
|
|
|
| A001435 |
|
Number of connected graphs with n nodes and n+1 edges.
(Formerly M3889 N1597)
|
|
+0
1
|
|
| 0, 0, 0, 1, 5, 19, 67, 236, 797, 2678, 8833, 28908, 93569, 300748, 959374, 3042808, 9597679, 30134509, 94218306, 293509092, 911325798, 2821327949, 8711297753, 26833501800, 82476837698, 253007383067, 7747377986836
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (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.
|
|
CROSSREFS
|
Sequence in context: A035344 A114277 A104496 this_sequence A092492 A070857 A143954
Adjacent sequences: A001432 A001433 A001434 this_sequence A001436 A001437 A001438
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
Description corrected by and more terms from Ron Read (rcread(AT)math.uwaterloo.ca), Aug 02 1996.
|
|
|
Search completed in 0.002 seconds
|
