|
Search: id:A140519
|
|
|
| A140519 |
|
Number of "king tours" on an n X n board. |
|
+0
3
|
|
| 1, 3, 16, 2830, 2462064, 22853860116, 1622043117414624, 961742089476282321684
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Or, number of Hamiltonian cycles in the graph P_n X P_n.
If the direction of the tour is to be taken into account, the numbers for n > 1 must be multiplied by 2 (see A140521).
Computed using ZDDs (ZDD = "reduced, order, zero-suppressed binary decision diagram").
|
|
REFERENCES
|
D. E. Knuth, The Art of Computer Programming, Section 7.1.4, in preparation.
|
|
CROSSREFS
|
Cf. A001230, A140521.
Sequence in context: A080273 A096404 A111824 this_sequence A109216 A090478 A140446
Adjacent sequences: A140516 A140517 A140518 this_sequence A140520 A140521 A140522
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
D. E. Knuth, Jul 26 2008
|
|
|
Search completed in 0.002 seconds
|
