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



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A001433 Number of graphs with n nodes and n-1 edges.
(Formerly M2588 N1024)

%I M2588 N1024

%S 1,1,1,3,6,15,41,115,345,1103,3664,12763,46415,175652,691001,2821116,

%T 11932174,52211412,236007973,1100528508,5287050500,26134330813,

%U 132760735671,692294900849,3701754158688

%N Number of graphs with n nodes and n-1 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="/A001433/b001433.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-1], {n, 1, 25}] (* _Robert G. Wilson v_ *)

%Y Cf. A008406.

%K nonn,easy,nice

%O 1,4

%A _N. J. A. Sloane_.

%E More terms from _Vladeta Jovovic_, Jan 15 2000

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 26 20:36 EDT 2020. Contains 337374 sequences. (Running on oeis4.)