Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096117
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A096117 Number of connected labeled graphs with n nodes and n+5 edges. +0
5
0, 0, 0, 0, 1, 1365, 290745, 35804384, 3431889000, 288982989000, 22716104811840, 1724903317684800, 129165517275377154, 9664573656742964960, 728813888470620552600, 55713446610261097382400 (list; graph; listen)
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.

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 A096224.

Sequence in context: A004970 A128285 A069310 this_sequence A140936 A022204 A015405

Adjacent sequences: A096114 A096115 A096116 this_sequence A096118 A096119 A096120

KEYWORD

nonn

AUTHOR

Keith M. Briggs, Aug 09 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research