A351109 Number of simple paths for a Racetrack car (using von Neumann neighborhood) with initial velocity zero, going from one corner to the diagonally opposite corner on an n X n grid.
1, 0, 2, 8, 40, 1380, 211164, 205331148
Offset: 1
Examples
For n = 4 the following paths, together with their reflections in the diagonal, exist. The numbers give the positions of the car after successive steps. In total, there are a(4) = 2*4 = 8 possible paths. ...3 ...4 ...4 ...5 .... ...3 ..3. ...4 ..2. ..2. ..2. ...3 01.. 01.. 01.. 012.
Links
- Wikipedia, Racetrack