%N Number of self-avoiding walks on a honeycomb lattice with a one-dimensional impenetrable boundary.
%C Bennett-Wood and Owczarek (1996) compute up to a(48).
%H D. Bennett-Wood and A. L. Owczarek, <a href="http://dx.doi.org/10.1088/0305-4470/29/16/004">Exact enumeration results for self-avoiding walks on the honeycomb lattice attached to a surface</a>, J. Phys. A: Math. Gen., 29 (1996), 4755-4768. [See Table 1, p. 4761.]
%e a(1)=3 because there are 3 directions on the lattice for the first step.
%e a(2)=4 because two of these 3 first steps are already "repelled" by the boundary and only the third has two choices to proceed.
%A _R. J. Mathar_, May 14 2006
%E Terms a(26) to a(35) were copied from Table 1 (p. 4761) in Bennett-Wood and Owczarek (1996) by _Petros Hadjicostas_, Jan 05 2019