Triangle read by rows: T(n,w) is the number of n-step self avoiding walks on a 3D cubic lattice confined between two infinite planes a distance w apart where the walk starts on one of the planes.

A338126

Triangle read by rows: T(n,w) is the number of n-step self avoiding walks on a 3D cubic lattice confined between two infinite planes a distance w apart where the walk starts on one of the planes.