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”).
%I M2586 #16 Jun 05 2017 03:51:44
%S 1,1,3,6,15,33,83,202,527,1377,3744,10335,29297,84396,248034,740289,
%T 2245094,6904206,21522973,67936799,217026480,701159919,2289925258,
%U 7556363054,25184139149,84743377436,287815771822,986345040471,3409869008578
%N Number of graphs with n nodes, n-2 edges and no isolated vertices.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H W. L. Kocay, <a href="http://www.combinatorialmath.ca/G&G/articles/algebraofsubgraphs.pdf">Some new methods in reconstruction theory</a>, 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.
%F a(n) = A001430(n) - A001433(n - 1). - _Sean A. Irvine_, Jun 05 2017
%Y Cf. A001430, A001433.
%K nonn
%O 4,3
%A _N. J. A. Sloane_.
%E More terms from _Vladeta Jovovic_, Mar 02 2008
%E More terms from _Sean A. Irvine_, Jun 05 2017