id:A002976 - OEIS Search Results

Search: id:A002976

Displaying 1-1 of 1 results found.

page 1

Number of self-avoiding walks with n steps on square lattice.
(Formerly M0034)

+0
1

0, 1, 0, 2, 0, 5, 9, 21, 42, 76, 174, 396, 888, 2023, 4345, 9921, 22566 (list; graph; listen)

	OFFSET	`4,4`
	REFERENCES	`W. A. Beyer and M. B. Wells, Lower bound for the connective constant of a self-avoiding walk on a square lattice, J. Combin. Theory, A 13 (1972), 176-182.`
	FORMULA	`a(n)=A006142(n)+2*A006143(n)+A006144(n). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 22 2007`
	CROSSREFS	`Sequence in context: A011435 A139309 A011014 this_sequence A080901 A137260 A047918` `Adjacent sequences: A002973 A002974 A002975 this_sequence A002977 A002978 A002979`
	KEYWORD	`nonn,walk,more`
	AUTHOR	`njas`

page 1

Search completed in 0.002 seconds

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.