Consider a single king on an infinite chessboard. This sequence gives number of n-move paths when king starting at origin reaches the origin again for the first time at step n.
A098070
Consider a single king on an infinite chessboard. This sequence gives number of n-move paths when king starting at origin reaches the origin again for the first time at step n.
Terms
- a(0) =1a(1) =0a(2) =8a(3) =24a(4) =152a(5) =816a(6) =5320a(7) =33840a(8) =229144a(9) =1560864a(10) =10906576a(11) =76962912a(12) =550406472a(13) =3969725856a(14) =28875757200a(15) =211436151456
External references
- oeis: A098070