|
%I M1538 N0601 #21 May 06 2018 13:15:43
%S 1,1,2,5,22,138,1579,33366,1348674,105925685,15968704512,
%T 4520384306832,2402814904220039,2425664021535713098,
%U 4647586298937784001491,16787189663016572148130262,114716901953374968257425111039
%N Number of connected graphs with n nodes and ceiling(n(n-1)/4) 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="/A001437/b001437.txt">Table of n, a(n) for n = 2..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 Largest entries in the rows of the table in A054924.
%K nonn,nice
%O 2,3
%A _N. J. A. Sloane_.
%E More terms from _Sean A. Irvine_, Jul 24 2012
|
