Number of paths to T(n,n,n) with T(i,j,k)= 0 if j>i or k>j and T(i,j,k) = T(i-1,j,k) + T(i,j-1,k) + T(i,j,k-1) and T(i,j,0) = 1.
A065058
Number of paths to T(n,n,n) with T(i,j,k)= 0 if j>i or k>j and T(i,j,k) = T(i-1,j,k) + T(i,j-1,k) + T(i,j,k-1) and T(i,j,0) = 1.
Terms
- a(0) =1a(1) =1a(2) =3a(3) =18a(4) =162a(5) =1851a(6) =24661a(7) =365613a(8) =5863881a(9) =99895425a(10) =1785024645a(11) =33156724734a(12) =635961987570
External references
- oeis: A065058