Number of distinct n-step paths of a knight moving on an n X n chessboard, starting to at a corner and not visiting any cell twice.
A272568
Number of distinct n-step paths of a knight moving on an n X n chessboard, starting to at a corner and not visiting any cell twice.
Terms
- a(0) =0a(1) =0a(2) =2a(3) =20a(4) =256a(5) =2086a(6) =16376a(7) =121418a(8) =871258a(9) =6077730a(10) =41586532a(11) =280783434a(12) =1875742356a(13) =12432917916a(14) =81868580330a(15) =536476588416
External references
- oeis: A272568