|
|
A351110
|
|
Triangle read by rows: T(m,n) is the number of paths for a Racetrack car (using Moore neighborhood) with initial velocity zero, going from one corner to the diagonally opposite corner on an m X n grid, such that all positions are visited exactly once, 1 <= n <= m.
|
|
2
|
|
|
1, 1, 0, 1, 1, 6, 1, 0, 15, 2, 1, 1, 70, 289, 9436, 1, 0, 294, 191, 128020
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,6
|
|
COMMENTS
|
For a Racetrack car using von Neumann neighborhood (see A351042), there are no such paths if 2 <= n <= m, because the car will never be able to leave a corner of the grid (except the corner where it starts).
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
m\n| 1 2 3 4 5 6
---+-----------------------
1 | 1
2 | 1 0
3 | 1 1 6
4 | 1 0 15 2
5 | 1 1 70 289 9436
6 | 1 0 294 191 128020 ?
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|