login
A334398
Number of endless self-avoiding walks of length n for the square lattice up to rotation, reflection, and path reversal.
0
1, 2, 3, 7, 16, 39, 96, 245, 631, 1642
OFFSET
1,2
COMMENTS
a(n) > A334322(n)/16.
LINKS
Nathan Clisby, Endless self-avoiding walks, arXiv:1302.2796 [cond-mat.stat-mech], 2013.
Code Golf Stack Exchange, Infinite Snake game
EXAMPLE
The a(4) = 7 step patterns of length 4 are
---->---->---->---->, ---->---->---->, ---->----> ,
| |
v v---->
---->---->, ----> ^, ----> , and ----> .
| | | | |
v v----> v----> v
| | |
v v v---->
CROSSREFS
Cf. A334322.
Sequence in context: A235112 A081207 A353580 * A027118 A114582 A352816
KEYWORD
nonn,walk,more
AUTHOR
STATUS
approved