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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A182294 Number of connected labeled graphs with n nodes and n+9 edges 2
0, 0, 0, 0, 0, 1, 20349, 21426300, 8956859646, 2352103292070, 470090359867986, 79002015147719136, 11836068369346126698, 1640443794179544776604, 215598057543037336382670 (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

Table of n, a(n) for n=0..14.

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+10), i=1..N)];

CROSSREFS

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

Sequence in context: A234631 A156408 A045815 * A103912 A256104 A269279

Adjacent sequences:  A182291 A182292 A182293 * A182295 A182296 A182297

KEYWORD

nonn

AUTHOR

Michael Burkhart, Apr 23 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 22 23:04 EDT 2019. Contains 321422 sequences. (Running on oeis4.)