|
Search: id:A006651
|
|
|
| A006651 |
|
Number of graphs with n nodes, n+2 edges and no isolated vertices.
(Formerly M3584)
|
|
+0
2
|
|
| 1, 4, 22, 110, 515, 2272, 9777, 40752, 166519, 668134, 2644988, 10351321, 40150556, 154591610, 591780559, 2254880616, 8561287942, 32418230925, 122522492807, 462502319244, 1744810912396, 6581954720648, 24839735669771
(list; graph; listen)
|
|
|
OFFSET
|
4,2
|
|
|
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. A048180.
Sequence in context: A024420 A108840 A007994 this_sequence A159616 A144047 A077543
Adjacent sequences: A006648 A006649 A006650 this_sequence A006652 A006653 A006654
|
|
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
|
