|
%I M1397 N0544 #28 Dec 23 2021 22:59:45
%S 0,0,0,1,1,2,5,11,25,66,172,485,1446,4541,15036,52496,192218,737248,
%T 2952621,12313532,53336122,239380403,1110793092,5318743428,
%U 26233496486,133074975399
%N Number of graphs with n nodes and n-4 edges.
%D J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 146.
%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="/A001432/b001432.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.
%t (* first do *) Needs["Combinatorica`"] (* then *) Table[ NumberOfGraphs[n, n-4], {n, 4, 26}] (* _Robert G. Wilson v_ *)
%Y Cf. A008406.
%K nonn,easy
%O 1,6
%A _N. J. A. Sloane_
%E More terms from _Vladeta Jovovic_, Jan 03 2000
|
