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.
A373036
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.
Terms
- a(0) =1a(1) =1a(2) =7a(3) =1a(4) =40a(5) =1135a(6) =1a(7) =216a(8) =28942a(9) =3329245a(10) =1a(11) =1144a(12) =707239a(13) =358911148a(14) =167176484530a(15) =1a(16) =6016a(17) =16963938a(18) =37502829018a(21) =1a(22) =31552a(23) =403490839
External references
- oeis: A373036