[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A006650
Number of graphs with n nodes, n+1 edges and no isolated vertices.
(Formerly M3903)
1
1, 5, 20, 73, 271, 974, 3507, 12487, 44475, 157814, 559952, 1985053, 7040855, 24986930, 88782435, 315911844, 1126178655, 4023135764, 14406870196, 51728509807, 186275015554, 672886200335
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
Sequence in context: A118049 A114247 A272086 * A034535 A316222 A273718
KEYWORD
nonn
AUTHOR
EXTENSIONS
More terms from Vladeta Jovovic, Mar 02 2008
STATUS
approved