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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A182371 Number of connected labeled graphs with n nodes and n+11 edges. 0
 0, 0, 0, 0, 0, 0, 1330, 6905220, 7279892361, 3717889913655, 1255470137209650, 326123611416074340, 70993993399632155710, 13659118629343706026053, 2405832308811599670396135, 397496768417871214784702640 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,7 REFERENCES 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. LINKS MAPLE 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)]; CROSSREFS 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). Sequence in context: A205091 A038854 A323329 * A252258 A038677 A202457 Adjacent sequences:  A182368 A182369 A182370 * A182372 A182373 A182374 KEYWORD nonn AUTHOR Michael Burkhart, Apr 26 2012 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 23 01:37 EST 2021. Contains 340384 sequences. (Running on oeis4.)