11,1

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.

See references given for A001412

Hugo Pfoertner, Results for the 3-dimensional Self-Trapping Random Walk

FORTRAN program provided at given link

Cf. A001412.

Sequence in context: A061964 A133667 A000877 this_sequence A032324 A032072 A002030

Adjacent sequences: A077814 A077815 A077816 this_sequence A077818 A077819 A077820

more,nonn

Hugo Pfoertner (hugo(AT)pfoertner.org), Nov 17 2002