|
%I M3583 N1453 #21 May 05 2021 18:00:08
%S 0,0,0,1,4,22,107,486,2075,8548,33851,130365,489387,1799700,6499706,
%T 23118465,81134475,281454170,966388692,3288208176,11098235911,
%U 37188198356,123800999503,409715126169,1348690034859,4417932007626,14407260221164
%N Number of connected graphs with n nodes, n+2 edges.
%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Sean A. Irvine, <a href="/A001436/b001436.txt">Table of n, a(n) for n = 1..40</a>
%H M. L. Stein and P. R. Stein, <a href="http://dx.doi.org/10.2172/4180737">Enumeration of Linear Graphs and Connected Linear Graphs up to p = 18 Points</a>. Report LA-3775, Los Alamos Scientific Laboratory of the University of California, Los Alamos, NM, Oct 1967.
%Y A diagonal of A054923.
%K nonn
%O 1,5
%A _N. J. A. Sloane_
%E Description corrected Aug 02 1996.
%E More terms from _Sean A. Irvine_, Jul 23 2012
|
