|
|
A351106
|
|
Triangle read by rows: T(m,n) is the number of simple 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, 1 <= n <= m.
|
|
3
|
|
|
1, 1, 3, 1, 6, 23, 2, 17, 118, 1470, 3, 47, 762, 23878, 914525, 5, 133, 5724, 420894, 40285572
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
m\n| 1 2 3 4 5 6
---+------------------------------
1 | 1
2 | 1 3
3 | 1 6 23
4 | 2 17 118 1470
5 | 3 47 762 23878 914525
6 | 5 133 5724 420894 40285572 ?
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|