|
Search: id:A006647
|
|
|
| A006647 |
|
Number of graphs with n nodes, n-2 edges and no isolated vertices.
(Formerly M2586)
|
|
+0
2
|
|
| 1, 1, 3, 6, 15, 33, 83, 202, 527, 1377, 3744, 10335, 29297, 84396, 248034, 740289, 2245094, 6904206, 21522973, 67936799, 217026480, 701159919, 2289925258
(list; graph; listen)
|
|
|
OFFSET
|
4,3
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
W. L. Kocay, Some new methods in reconstruction theory, pp. 89 - 114 of Combinatorial Mathematics IX. Proc. Ninth Australian Conference (Brisbane, August 1981). Ed. E. J. Billington, S. Oates-Williams and A. P. Street. Lecture Notes Math., 952. Springer-Verlag, 1982.
|
|
CROSSREFS
|
Cf. A001430, A001433.
Sequence in context: A105476 A000599 A063832 this_sequence A032126 A032176 A027600
Adjacent sequences: A006644 A006645 A006646 this_sequence A006648 A006649 A006650
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Mar 02 2008
|
|
|
Search completed in 0.002 seconds
|
