Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096150
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A096150 Number of connected labeled graphs with n nodes and n+7 edges. +0
5
0, 0, 0, 0, 0, 105, 116175, 37007656, 7032842901, 1016662746825, 125217059384890, 13979620699390500, 1468384747758433362, 148610523724144786304, 14725179052834536611325 (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.

Adjacent sequences: A096147 A096148 A096149 this_sequence A096151 A096152 A096153

Sequence in context: A111647 A054862 A028917 this_sequence A068256 A062031 A036201

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 October 6 16:13 EDT 2008. Contains 144667 sequences.


AT&T Labs Research