A124964 - OEIS

This site is supported by donations to The OEIS Foundation.

A124964

Total counts of distinct (directed) Hamiltonian cycles for all simple graphs of order n.

0, 0, 2, 10, 58, 616, 9932, 333386, 25153932, 4548577688 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,3`
	LINKS	`Eric Weisstein's World of Mathematics, Hamiltonian Cycle`
	CROSSREFS	`For Hamiltonian paths, see A193352` `Sequence in context: A086871 A108450 A112369 * A026132 A186758 A202482` `Adjacent sequences: A124961 A124962 A124963 * A124965 A124966 A124967`
	KEYWORD	`nonn,more,hard`
	AUTHOR	`Eric Weisstein (eric(AT)weisstein.com), Nov 14, 2006`
	EXTENSIONS	`a(7)-a(10) from Eric W. Weisstein (eric(AT)weisstein.com), Jul 23-24 2011`

Content is available under The OEIS End-User License Agreement .

Last modified February 15 20:03 EST 2012. Contains 205852 sequences.