id:A117633 - OEIS Search Results

Search: id:A117633

Displaying 1-1 of 1 results found.

page 1

Number of self-avoiding walks of n steps on a Manhattan square lattice.

+0
1

2, 4, 8, 14, 26, 48, 88, 154, 278, 500, 900, 1576, 2806, 4996, 8894, 15564, 27538, 48726, 86212, 150792, 265730, 468342, 825462, 1442866, 2535802, 4457332, 7835308, 13687192 (list; graph; listen)

	OFFSET	`1,1`
	LINKS	`A. Malakis, Self-avoiding walks on oriented square lattices,J. Phys. A: Math. Gen. 8 (1975) no 12, 1885-1898`
	EXAMPLE	`On each crossing, the first step may follow a street or an avenue. So a(1)=2.` `On the next crossing, each of these 2 paths faces again two choices, giving a(2)=4. At n=4, a(4) becomes less than 16 considering the 2 cases of having moved around a block.`
	CROSSREFS	`Sequence in context: A120545 A130708 A054193 this_sequence A135491 A164154 A164156` `Adjacent sequences: A117630 A117631 A117632 this_sequence A117634 A117635 A117636`
	KEYWORD	`nonn`
	AUTHOR	`R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 08 2006`

page 1

Search completed in 0.002 seconds

Last modified December 21 10:15 EST 2009. Contains 171081 sequences.

AT&T Labs Research