This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A078800 Sum of end-to-end Manhattan distances over all self-avoiding walks on square lattice trapped after n steps. 1
 1, 4, 21, 72, 271, 858, 2846, 8632, 26913, 79504, 238881, 693210, 2033133, 5823100, 16794540, 47619222, 135663289, 381615476, 1077064799 (list; graph; refs; listen; history; text; internal format)
 OFFSET 7,2 COMMENTS The mean Manhattan displacement is given by a(n)/A077482(n) See also "Average Manhattan end point distance" and "Comparison of average Euclidean and Manhattan displacements" at link LINKS Hugo Pfoertner, Results for the 2D Self-Trapping Random Walk EXAMPLE a(9)=21 because the A077482(9)=11 different self-trapping walk stop at 5*(0,1)->d=1, 2*(1,2)->d=3, 2*(2,1)->d=3,(-1,0)->d=1,(3,0)->d=3. a(9)=5*1+2*3+2*3+1+3=21 PROG FORTRAN program for distance counting available at link CROSSREFS Cf. A077482, A078798, A078799 (corresponding squared distance sum). Sequence in context: A089893 A212246 A095668 * A184706 A057333 A034960 Adjacent sequences:  A078797 A078798 A078799 * A078801 A078802 A078803 KEYWORD nonn AUTHOR Hugo Pfoertner, Dec 28 2002 STATUS approved

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

Last modified December 15 00:30 EST 2019. Contains 329988 sequences. (Running on oeis4.)