id:A118355 - OEIS Search Results

Search: id:A118355

Displaying 1-1 of 1 results found.

page 1

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

+0
2

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; listen)

	OFFSET	`1,1`
	COMMENT	`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 this_sequence A026632 A026654 A104370` `Adjacent sequences: A118352 A118353 A118354 this_sequence A118356 A118357 A118358`
	KEYWORD	`nonn`
	AUTHOR	`R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 14 2006`

page 1

Search completed in 0.002 seconds

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.

AT&T Labs Research