[seqfan] Re: Quick question about self-avoiding walks

[Heinz, Alois]

Perhaps this:
http://oeis.org/A145157

A145157 Number of Greek-key tours on an n X n board; i.e.
self-avoiding walks on n X n grid starting in top left corner.

1, 2, 8, 52, 824, 22144, 1510446, ...

search for more:
http://oeis.org/search?q=Greek-key&sort=&language=english&go=Search

Alois

Am 10.12.2011 07:27, schrieb Alonso Del Arte:
> 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? Here is an
> example of what I'm talking about:
> http://oeis.org/wiki/File:Walks_on_8_by_8_SqLattice.png I would look it up
> myself but I don't know the proper word for it nor have I thought about how
> to calculate terms.
>
> Al