id:A053527 - OEIS Search Results

Search: id:A053527

Displaying 1-1 of 1 results found.

page 1

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

+0
3

0, 0, 0, 0, 3, 140, 1125, 5355, 19075, 56133, 143955, 332475, 706860, 1404975, 2640638, 4733820, 8149050, 13543390, 21825450, 34227018, 52388985, 78463350, 115233195, 166252625, 236008773, 330108075, 455489125, 620664525, 835994250 (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)(n^3-5n-36)/384.`
	CROSSREFS	`Cf. A000217 (1 edge), A050534 (2 edges), A053526 (3 edges).` `Adjacent sequences: A053524 A053525 A053526 this_sequence A053528 A053529 A053530` `Sequence in context: A139956 A016067 A070322 this_sequence A152504 A035331 A050819`
	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 November 8 20:39 EST 2009. Contains 166234 sequences.

AT&T Labs Research