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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096224 Number of connected labeled graphs with n nodes and n+8 edges. 7
0, 0, 0, 0, 0, 15, 54257, 30258935, 8403710364, 1624745199910, 253717024819170, 34644709397517912, 4336461198140896396, 512755474242717445740, 58441126001104710458595 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,6

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.

CROSSREFS

Cf. connected labeled graphs with n nodes and n+k edges for k=0..8: A057500 A061540 A061541 A061542 A061543 A096117 A061544 A096150 and this sequence.

Sequence in context: A185902 A013756 A078185 * A129613 A248734 A259210

Adjacent sequences:  A096221 A096222 A096223 * A096225 A096226 A096227

KEYWORD

nonn

AUTHOR

Keith M. Briggs, Aug 09 2004

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 20 21:49 EDT 2019. Contains 321352 sequences. (Running on oeis4.)