login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A001433 Number of graphs with n nodes and n-1 edges.
(Formerly M2588 N1024)
5
1, 1, 1, 3, 6, 15, 41, 115, 345, 1103, 3664, 12763, 46415, 175652, 691001, 2821116, 11932174, 52211412, 236007973, 1100528508, 5287050500, 26134330813, 132760735671, 692294900849, 3701754158688 (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

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-1], {n, 1, 25}] (* Robert G. Wilson v *)

CROSSREFS

Cf. A008406.

Sequence in context: A218777 A152799 A140824 * A005368 A067771 A289678

Adjacent sequences:  A001430 A001431 A001432 * A001434 A001435 A001436

KEYWORD

nonn,easy,nice

AUTHOR

N. J. A. Sloane.

EXTENSIONS

More terms from Vladeta Jovovic, Jan 15 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified May 20 18:46 EDT 2018. Contains 304347 sequences. (Running on oeis4.)