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

 

Logo
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

%I M1382 N0540 #28 Dec 23 2021 23:00:08

%S 0,0,1,1,2,5,10,24,63,165,467,1405,4435,14775,51814,190443,732472,

%T 2939612,12277230,53233295,239083372,1109921554,5316143531,

%U 26225625392,133050795412,693227353094,3704785464812

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

%Y Cf. A008406.

%K nonn,easy

%O 1,5

%A _N. J. A. Sloane_

%E More terms from _Vladeta Jovovic_, Jan 12 2000

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 04:23 EDT 2024. Contains 371264 sequences. (Running on oeis4.)