|
%I #19 Aug 29 2020 02:10:38
%S 1,2,3,7,16,39,96,245,631,1642
%N Number of endless self-avoiding walks of length n for the square lattice up to rotation, reflection, and path reversal.
%C a(n) > A334322(n)/16.
%H Nathan Clisby, <a href="https://arxiv.org/abs/1302.2796">Endless self-avoiding walks</a>, arXiv:1302.2796 [cond-mat.stat-mech], 2013.
%H Code Golf Stack Exchange, <a href="https://codegolf.stackexchange.com/a/203971/53884">Infinite Snake game</a>
%e The a(4) = 7 step patterns of length 4 are
%e ---->---->---->---->, ---->---->---->, ---->----> ,
%e | |
%e v v---->
%e ---->---->, ----> ^, ----> , and ----> .
%e | | | | |
%e v v----> v----> v
%e | | |
%e v v v---->
%Y Cf. A334322.
%K nonn,walk,more
%O 1,2
%A _Peter Kagey_ and _Arnauld Chevallier_, Apr 26 2020
|
