number of loops of length $n$ without crossings in random walk on $\mathbb{Z}^2$

126 Views Asked by At

Consider the symmetric random walk on $\mathbb{Z}^2$, where you go in one of the four directions with probability 1/4. We start in 0. My question is whether there are results on counting how many ways there are to do a random walk of $n$ steps and get back to the starting point without ever crossing a point where you have already been, except of course the starting point. Thank you very much.

1

There are 1 best solutions below

2
On BEST ANSWER

I believe you want sequence A010566 at OEIS; there are many references. There are many related sequences as well; the general search term you want is self-avoiding [closed] random walk.