The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A001434 Number of graphs with n nodes and n edges. (Formerly M1653 N0647) 4
 0, 0, 1, 2, 6, 21, 65, 221, 771, 2769, 10250, 39243, 154658, 628635, 2632420, 11353457, 50411413, 230341716, 1082481189, 5228952960, 25945377057, 132140242356, 690238318754, 3694876952577 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 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 CombOS - Combinatorial Object Server, Generate graphs 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], {n, 24}] (* Robert G. Wilson v, Mar 22 2011 *) CROSSREFS Cf. A008406. Sequence in context: A228394 A245749 A342440 * A119098 A294706 A294707 Adjacent sequences:  A001431 A001432 A001433 * A001435 A001436 A001437 KEYWORD nonn,easy,nice AUTHOR EXTENSIONS More terms from Vladeta Jovovic, Jan 07 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 11 15:10 EDT 2022. Contains 356066 sequences. (Running on oeis4.)