|
%I #4 Mar 31 2012 10:29:01
%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="http://www.randomwalk.de/stw3d.html">Results for the 3-dimensional Self-Trapping Random Walk</a>
%o FORTRAN program provided at given link
%Y Cf. A001412.
%K more,nonn
%O 11,1
%A _Hugo Pfoertner_, Nov 17 2002
| 