Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A165134
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A165134 Number of knight's paths visiting each square of a chessboard exactly once. +0
1
0, 0, 1728, 6637920 (list; graph; listen)
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 this_sequence A013797 A013864 A112140

Adjacent sequences: A165131 A165132 A165133 this_sequence A165135 A165136 A165137

KEYWORD

nonn

AUTHOR

[No name given] (c.candide(AT)free.fr), Sep 04 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research