37502829018
domain: N
Appears in sequences
- Number of 4 X n mazes that can be navigated from the top left corner to the bottom right corner.at n=5A365629
- Triangle read by rows: T(n,k) is the number of edge subsets E of the n X k grid graph such that E contains a path between the top left node and the bottom right node, 1 <= k <= n.at n=18A373036