id:A096224 - OEIS Search Results

Search: id:A096224

Displaying 1-1 of 1 results found.

page 1

Number of connected labeled graphs with n nodes and n+8 edges.

+0
5

0, 0, 0, 0, 0, 15, 54257, 30258935, 8403710364, 1624745199910, 253717024819170, 34644709397517912, 4336461198140896396, 512755474242717445740, 58441126001104710458595 (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 this sequence.` `Sequence in context: A104682 A013756 A078185 this_sequence A129613 A013802 A084878` `Adjacent sequences: A096221 A096222 A096223 this_sequence A096225 A096226 A096227`
	KEYWORD	`nonn`
	AUTHOR	`Keith M. Briggs, Aug 09 2004`

page 1

Search completed in 0.002 seconds

Last modified December 4 23:11 EST 2009. Contains 170347 sequences.

AT&T Labs Research