a(n) is the number of different self-avoiding (n-1)-move routes for a king on an empty n X n chessboard.
A355844
a(n) is the number of different self-avoiding (n-1)-move routes for a king on an empty n X n chessboard.
Terms
- a(0) =1a(1) =12a(2) =160a(3) =1764a(4) =17280a(5) =156484a(6) =1335984a(7) =10899404a(8) =85743256a(9) =654854660a(10) =4880419048a(11) =35632524244a(12) =255652444992
External references
- oeis: A355844