Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A078800
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A078800 Sum of end-to-end Manhattan distances over all self-avoiding walks on square lattice trapped after n steps. +0
2
1, 4, 21, 72, 271, 858, 2846, 8632, 26913, 79504, 238881, 693210, 2033133, 5823100, 16794540, 47619222, 135663289, 381615476, 1077064799 (list; graph; listen)
OFFSET

7,2

COMMENT

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

PROGRAM

FORTRAN program for distance counting available at link

CROSSREFS

Cf. A077482, A078798, A078799 (corresponding squared distance sum).

Sequence in context: A131478 A089893 A095668 this_sequence A057333 A034960 A157493

Adjacent sequences: A078797 A078798 A078799 this_sequence A078801 A078802 A078803

KEYWORD

nonn

AUTHOR

Hugo Pfoertner (hugo(AT)pfoertner.org), Dec 28 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research