4775133828

Appears in sequences

• Triangle T(n,k), n>=0, 0 <= k <= n, read by rows, where T(n,k) is the number of self-avoiding paths in (2*n+1) X (2*k+1) grid starting the upper left corner, passing through the center of grid and finishing the lower right corner.at n=17A333685
• Number of self-avoiding paths in (2*n+1) X 5 grid starting the upper left corner, passing through the center of grid and finishing the lower right corner.at n=5A333689