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.
A333685
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.
Terms
- a(0) =1a(1) =1a(2) =10a(3) =1a(4) =101a(5) =7056a(6) =1a(7) =1105a(8) =610765a(9) =462755440a(10) =1a(11) =12046a(12) =53968755a(13) =365962179700a(15) =1a(16) =131399a(17) =4775133828
External references
- oeis: A333685