login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A323857 Sum of end-to-end Manhattan distances over all self-avoiding n-step walks on 4-d cubic lattice. 3
1, 14, 135, 1144, 9083, 69690, 522781, 3864524, 28243251, 204687550, 1473038447, 10542725976, 75096139471, 532846305962, 3767808141891, 26566180648012, 186826646453453 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

The first step is kept fixed, i.e., (0,0,0,0) -> (1,0,0,0).

LINKS

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

EXAMPLE

a(3) = 135, because there are 6 (of A010575(3)/8=49) end points with Manhattan distance 1, (0,-1,0,0), (0,1,0,0), (0,0,-1,0), (0,0,1,0), (0,0,0,-1), (0,0,0,1), and the remaining 43 end points all have Manhattan distance 3, e.g., (3,0,0,0), (2,-1,0,0), ..., (1,-1,-1,0), ... 135 = 6*1 + 43*3.

CROSSREFS

Cf. A010575, A079156, A242355, A323856.

Sequence in context: A073554 A272652 A016801 * A244651 A004004 A002753

Adjacent sequences:  A323854 A323855 A323856 * A323858 A323859 A323860

KEYWORD

nonn,walk,more

AUTHOR

Hugo Pfoertner, Feb 03 2019

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 18 15:30 EST 2020. Contains 332019 sequences. (Running on oeis4.)