|
Search: id:A034010
|
|
|
| A034010 |
|
Number of 2n-step self avoiding closed walks on square grid, restricted to a quadrant and passing through origin. |
|
+0
3
|
|
| 0, 1, 2, 6, 20, 74, 300, 1302, 5944, 28266, 139010, 703102, 3641956, 19255106, 103630920
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
B. Hayes, How to avoid yourself, American Scientist, Vol. 86, Number 4, Jul-August 1998. p. 314-319
|
|
EXAMPLE
|
When the number of steps is 8, one of the six closed paths is
0___.
| ._|
|_|
|
|
CROSSREFS
|
A subset of the polyominoes with perimeter 2n (A006725), also a subset of A002931. Cf. A000105, A038373.
Sequence in context: A104632 A107284 A006850 this_sequence A135588 A134957 A052889
Adjacent sequences: A034007 A034008 A034009 this_sequence A034011 A034012 A034013
|
|
KEYWORD
|
nonn,hard,walk
|
|
AUTHOR
|
Felice Russo (felice.russo(AT)katamail.com)
|
|
EXTENSIONS
|
Corrected and extended by David W. Wilson (davidwwilson(AT)comcast.net)
|
|
|
Search completed in 0.005 seconds
|
