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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A182371 Number of connected labeled graphs with n nodes and n+11 edges. 0

%I

%S 0,0,0,0,0,0,1330,6905220,7279892361,3717889913655,1255470137209650,

%T 326123611416074340,70993993399632155710,13659118629343706026053,

%U 2405832308811599670396135,397496768417871214784702640

%N Number of connected labeled graphs with n nodes and n+11 edges.

%D S. Janson, D. E. Knuth, T. Luczak and B. Pittel, The Birth of the Giant Component, Random Structures and Algorithms Vol. 4 (1993), 233-358.

%p N:=20: [seq(coeff(op(i, [seq(coeff(taylor(log(add(x^i*(1+y)^(binomial(i, 2))/i!, i=0..N)), x=0, N+1), x, i)*i!, i=1..N)]), y, i-1+12), i=1..N)];

%Y Cf. A057500, A061540, A061541, A061542, A061543, A096117, A061544, A096150, A096224, A182294, A182295 (connected labeled graphs with n nodes and n+k edges for k=0..10).

%K nonn

%O 0,7

%A _Michael Burkhart_, Apr 26 2012

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 March 23 05:36 EDT 2019. Contains 321422 sequences. (Running on oeis4.)