login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006745 Number of indefinitely growing n-step self-avoiding walks on Manhattan lattice.
(Formerly M1071)
0
1, 2, 4, 7, 13, 24, 43, 77, 139, 249, 443, 786, 1400, 2486, 4395, 7758, 13732, 24251, 42710, 75154, 132487, 233173, 409617, 719157, 1264303, 2219916, 3892603, 6822808, 11970965, 20983162, 36742831, 64319064 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Table of n, a(n) for n=1..32.

S. S. Manna and A. J. Guttmann, Kinetic growth walks and trails on oriented square lattices: Hull percolation and percolation hulls, J. Phys. A 22 (1989), 3113-3122.

CROSSREFS

Sequence in context: A002574 A069765 A090427 * A049284 A049285 A002843

Adjacent sequences:  A006742 A006743 A006744 * A006746 A006747 A006748

KEYWORD

nonn,walk

AUTHOR

Simon Plouffe

EXTENSIONS

a(31)-a(32) from Sean A. Irvine, Jul 13 2017

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 26 05:48 EST 2022. Contains 358353 sequences. (Running on oeis4.)