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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A182295 Number of connected labeled graphs with n nodes and n+10 edges. 1
0, 0, 0, 0, 0, 0, 5985, 13112470, 8535294180, 3096620034795, 800118566011380, 166591475854153740, 30012638793107746776, 4892304538906805158775, 743352352817243899253160 (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+11), i=1..N)];

CROSSREFS

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

Sequence in context: A237011 A274362 A233871 * A028546 A055108 A046903

Adjacent sequences:  A182292 A182293 A182294 * A182296 A182297 A182298

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 April 23 13:25 EDT 2019. Contains 322386 sequences. (Running on oeis4.)