Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #15 Dec 23 2018 09:47:44
%S 1,2,6,19,66,229,831,2991,10859
%N Number of unrooted self-avoiding walks with n steps that can make turns from the set +-Pi/5, +-3*Pi/5.
%C The turning angles are those of the regular pentagon, with one vertex corresponding to the forbidden U-turn. The path may neither intersect nor touch itself anywhere.
%H Contest Organizers, <a href="http://www.recmath.org/contest/Snakes/index.php">Al Zimmermann's Programming Contests - Snakes on a Plane</a>, Fall 2006.
%H Hugo Pfoertner, <a href="http://www.randomwalk.de/sequences/a306175.htm">Illustration of walks of lengths <= 5</a>.
%Y Cf. A266925, A037245, A151541, A306177, A306178, A306179, A306180, A306181, A306182, A316195.
%K nonn,walk,more
%O 1,2
%A _Hugo Pfoertner_, Jun 23 2018
%E a(7)-a(9) from _Hugo Pfoertner_, Dec 23 2018