167176484530
domain: N
Appears in sequences
- 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=14A373036
- Number of edge subsets E of the n X n square grid graph such that E contains a path between the top left node and the bottom right node.at n=4A373037