login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A118355 Number of self-avoiding walks on a honeycomb lattice with a one-dimensional impenetrable boundary. 1
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 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Bennett-Wood et al. compute up to a(48).

LINKS

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

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: A136425 A005907 A049866 * A026632 A026654 A104370

Adjacent sequences:  A118352 A118353 A118354 * A118356 A118357 A118358

KEYWORD

nonn

AUTHOR

R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 14 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 17:46 EST 2012. Contains 205835 sequences.