This site is supported by donations to The OEIS Foundation.



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A048180 Number of graphs with n nodes and n+2 edges. 4


%S 1,4,24,131,663,3252,15772,75415,359307,1711908,8191607,39500169,

%T 192525021,950868860,4769060224,24331970791,126457607026,670143402073,

%U 3623530476832,19998343352758,112668088476243,647904733883526

%N Number of graphs with n nodes and n+2 edges.

%D J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 146.

%H Sean A. Irvine, <a href="/A048180/b048180.txt">Table of n, a(n) for n = 4..36</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

%Y Cf. A008406.

%K nonn,easy

%O 4,2

%A _N. J. A. Sloane_.

%E More terms from _Vladeta Jovovic_, Jan 03 2000

%E More terms from _Sean A. Irvine_, Jun 07 2017

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 November 16 17:25 EST 2018. Contains 317275 sequences. (Running on oeis4.)