A118355 Number of self-avoiding walks on a honeycomb lattice with a one-dimensional impenetrable boundary.

3, 4, 8, 14, 28, 46, 90, 160, 308, 540, 1032, 1846, 3502, 6272, 11852, 21364, 40234, 72694, 136564, 247498, 464070, 842546, 1577280, 2868922, 5364030, 9769366, 18245976, 33272104, 62086194, 113326264, 211304042, 386039204, 719319094, 1315132086, 2449100566

Offset

1,1

Comments

Bennett-Wood and Owczarek (1996) compute up to a(48).

Links

Table of n, a(n) for n=1..35.

D. Bennett-Wood and A. L. Owczarek, Exact enumeration results for self-avoiding walks on the honeycomb lattice attached to a surface, J. Phys. A: Math. Gen., 29 (1996), 4755-4768. [See Table 1, p. 4761.]

Example

a(1)=3 because there are 3 directions on the lattice for the first step.
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.

Crossrefs

Sequence in context: A331330 A005907 A049866 * A026632 A332985 A026654

Adjacent sequences: A118352 A118353 A118354 * A118356 A118357 A118358

Keyword

nonn

Author

R. J. Mathar, May 14 2006

Extensions

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

Status

approved