The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A001431 Number of graphs with n nodes and n-3 edges. (Formerly M1382 N0540) 2
 0, 0, 1, 1, 2, 5, 10, 24, 63, 165, 467, 1405, 4435, 14775, 51814, 190443, 732472, 2939612, 12277230, 53233295, 239083372, 1109921554, 5316143531, 26225625392, 133050795412, 693227353094, 3704785464812 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 REFERENCES J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 146. N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence). N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). LINKS Sean A. Irvine, Table of n, a(n) for n = 1..40 M. L. Stein and P. R. Stein, Enumeration of Linear Graphs and Connected Linear Graphs up to p = 18 Points. Report LA-3775, Los Alamos Scientific Laboratory of the University of California, Los Alamos, NM, Oct 1967. MATHEMATICA (* first do *) Needs["Combinatorica`"] (* then *) Table[ NumberOfGraphs[n, n-3], {n, 3, 27}] (* Robert G. Wilson v *) CROSSREFS Cf. A008406. Sequence in context: A321007 A253013 A192471 * A324149 A054866 A242935 Adjacent sequences:  A001428 A001429 A001430 * A001432 A001433 A001434 KEYWORD nonn,easy AUTHOR EXTENSIONS More terms from Vladeta Jovovic, Jan 12 2000 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 27 00:14 EDT 2020. Contains 337378 sequences. (Running on oeis4.)