login
Number of self-avoiding walks on the cubic lattice trapped after n steps.
6

%I #11 Oct 21 2024 01:21:00

%S 5,20,229,921,7156,29567,193932,821797,4902336

%N Number of self-avoiding walks on the cubic lattice trapped after n steps.

%C Only 1/48 of all possible walks is counted by selecting the first step in +x direction and requiring the first steps changing y and z to be positive, with the first +y step before the first +z step.

%D See references given for A001412

%H Hugo Pfoertner, <a href="https://www.randomwalk.de/stw3d.html">Results for the 3-dimensional Self-Trapping Random Walk</a>.

%o (Fortran) c Program provided at given link

%Y Cf. A001412, A077818, A077819, A077820, A377161, A377162.

%K walk,hard,more,nonn

%O 11,1

%A _Hugo Pfoertner_, Nov 17 2002