login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A186441 Number of n-vertex knight's tours on the 8x8 chessboard summed over all choices for the starting position. 2
64, 336, 1672, 8320, 39616, 186544, 847520, 3846192 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

REFERENCES

L. Lant, A method for calculating the Knight's total tour count, Congress. Numerant., 202 (2010), 33-40. [Lant comments that "a(5)=40208 has not yet been verified."]

LINKS

Table of n, a(n) for n=1..8.

Ron Hardin, Knight's tour A186441, seqfan mailing list Feb 23 2011

EXAMPLE

a(1) = 64, since the knight cannot move.

CROSSREFS

Cf. A001230.

Column 6 of A186851

Sequence in context: A211258 A252080 A017366 * A061102 A016779 A137739

Adjacent sequences:  A186438 A186439 A186440 * A186442 A186443 A186444

KEYWORD

nonn,fini,more

AUTHOR

N. J. A. Sloane, Feb 21 2011

EXTENSIONS

a(5) to a(8) are tabulated here as computed by R. Hardin and D. S. McNeil.

Ambiguous a(0) removed by Max Alekseyev, Sep 22 2013

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified March 24 06:12 EDT 2017. Contains 283984 sequences.