403490839

Appears in sequences

• Number of edge subsets E of the 3 X n grid graph such that E contains a path between the top left node and the bottom right node.at n=6A349596
• 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=23A373036