|
Search: id:A006650
|
|
|
| A006650 |
|
Number of graphs with n nodes, n+1 edges and no isolated vertices.
(Formerly M3903)
|
|
+0
1
|
|
| 1, 5, 20, 73, 271, 974, 3507, 12487, 44475, 157814, 559952, 1985053, 7040855, 24986930, 88782435, 315911844, 1126178655, 4023135764, 14406870196, 51728509807, 186275015554, 672886200335
(list; graph; listen)
|
|
|
OFFSET
|
4,2
|
|
|
REFERENCES
|
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.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
CROSSREFS
|
Cf. A048179, A048180.
Sequence in context: A137212 A118049 A114247 this_sequence A034535 A094806 A026639
Adjacent sequences: A006647 A006648 A006649 this_sequence A006651 A006652 A006653
|
|
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
|
