id:A053526 - OEIS Search Results

Search: id:A053526

Displaying 1-1 of 1 results found.

page 1

Number of bipartite graphs with 3 edges on nodes {1..n}.

+0
4

0, 0, 0, 0, 16, 110, 435, 1295, 3220, 7056, 14070, 26070, 45540, 75790, 121121, 187005, 280280, 409360, 584460, 817836, 1124040, 1520190, 2026255, 2665355, 3464076, 4452800, 5666050, 7142850, 8927100, 11067966, 13620285 (list; graph; listen)

	OFFSET	`0,5`
	REFERENCES	`R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see Problem 5.5.`
	FORMULA	`(n-3)(n-2)(n-1)n(n^2+3n+4)/48.`
	CROSSREFS	`Cf. A000217 (1 edge), A050534 (2 edges).` `Sequence in context: A165558 A155871 A120668 this_sequence A107908 A144449 A000143` `Adjacent sequences: A053523 A053524 A053525 this_sequence A053527 A053528 A053529`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Jan 16 2000`

page 1

Search completed in 0.002 seconds

Last modified December 16 17:18 EST 2009. Contains 170825 sequences.

AT&T Labs Research