A006651 - OEIS

A006651

Number of graphs with n nodes, n+2 edges and no isolated vertices.
(Formerly M3584)

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; refs; listen; history; text; internal format)

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).

LINKS

Table of n, a(n) for n=4..26.

CROSSREFS

Cf. A048180.

Sequence in context: A220457 A108840 A007994 * A159616 A244423 A144047

Adjacent sequences: A006648 A006649 A006650 * A006652 A006653 A006654

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

EXTENSIONS

More terms from Vladeta Jovovic, Mar 02 2008

STATUS

approved