A165134 - OEIS

This site is supported by donations to The OEIS Foundation.

A165134

Number of knight's paths visiting each square of a chessboard exactly once.

0, 0, 1728, 6637920 (list; graph; refs; listen; history; internal format)

	OFFSET	`3,3`
	REFERENCES	`P. Hingston, G. Kendall, Enumerating knight's tours using an ant colony algorithm, The 2005 IEEE Congress on Evolutionary Computation, 2 (2006), 1003-1010`
	LINKS	`The Knight's Paths`
	CROSSREFS	`Sequence in context: A002519 A052068 A114767 * A013797 A013864 A112140` `Adjacent sequences: A165131 A165132 A165133 * A165135 A165136 A165137`
	KEYWORD	`nonn`
	AUTHOR	`[No name given] (c.candide(AT)free.fr), Sep 04 2009`

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

Last modified February 16 14:07 EST 2012. Contains 205930 sequences.