id:A143248 - OEIS Search Results

Search: id:A143248

Displaying 1-1 of 1 results found.

page 1

Number of (directed) Hamiltonian circuits in the complete bipartite graph K_{n,n}.

+0
1

0, 12, 144, 2880, 86400, 3628800, 203212800, 14631321600, 1316818944000, 144850083840000, 19120211066880000, 2982752926433280000, 542861032610856960000, 114000816848279961600000 (list; graph; listen)

	OFFSET	`1,2`
	LINKS	`Eric Weisstein's World of Mathematics, BipartiteGraph` `Eric Weisstein's World of Mathematics, HamiltonianCircuit`
	FORMULA	`a(1) = 0, a(n) = n!(n+1)!` `a(n)=A010790(n), n>1. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 15 2008]`
	CROSSREFS	`Sequence in context: A000468 A076728 A123237 this_sequence A138444 A137886 A097303` `Adjacent sequences: A143245 A143246 A143247 this_sequence A143249 A143250 A143251`
	KEYWORD	`nonn`
	AUTHOR	`E. W. Weisstein (eric(AT)weisstein.com), Aug 01, 2008`

page 1

Search completed in 0.002 seconds

Last modified December 11 12:57 EST 2009. Contains 170656 sequences.

AT&T Labs Research