[seqfan] Re: Quick question about self-avoiding walks
D. S. McNeil
dsm054 at gmail.com
Sat Dec 10 11:44:00 CET 2011
On Sat, Dec 10, 2011 at 1:27 AM, Alonso Del Arte
<alonso.delarte at gmail.com> wrote:
> Does the OEIS have the sequence of the number of distinct self-avoiding
> walks possible on an n^2 lattice where every vertex is visited?
Depends on what you mean by distinct. There's A120443, for example.
The version where we mod out by the graph so that the n=2 case only
has one distinct path doesn't seem to exist.
More information about the SeqFan