A348201 Number of walks on cubic lattice from (n,n,n) to (0,0,0) using steps that decrease the Euclidean distance to the origin and that change each coordinate by 1 or by -1.

1, 1, 25, 211, 4057, 79945, 1559719, 34166335, 784027759, 18367309153, 447879467629, 11160419719795, 283032843838285, 7307188685246689, 191139484940529781, 5056715112537049897, 135152031778121985907, 3642958379395296513337, 98930628058690700138443

Offset

0,3

Comments

Lattice points may have negative coordinates, and different walks may differ in length. All walks are self-avoiding.

All terms are odd.

Links

Alois P. Heinz, Table of n, a(n) for n = 0..681

Wikipedia, Counting lattice paths

Wikipedia, Self-avoiding walk

Formula

a(n) ~ c * d^n / n, where d = (3*(292 + 4*sqrt(5))^(1/3))/2 + 66/(292 + 4*sqrt(5))^(1/3) + 10 = 29.900786688498085577218938127572448... and c = 0.00221301854906444252905280527969234142... - Vaclav Kotesovec, Oct 24 2021

Example

a(2) = 25:
  ((2,2,2), (1,1,1), (0,0,0)),
  ((2,2,2), (1,1,3), (0,0,2), (-1,-1,1), (0,0,0)),
  ((2,2,2), (1,1,3), (0,0,2), (-1,1,1), (0,0,0)),
  ((2,2,2), (1,1,3), (0,0,2), (1,-1,1), (0,0,0)),
  ((2,2,2), (1,1,3), (0,0,2), (1,1,1), (0,0,0)),
  ((2,2,2), (1,1,3), (0,2,2), (-1,1,1), (0,0,0)),
  ((2,2,2), (1,1,3), (0,2,2), (1,1,1), (0,0,0)),
  ((2,2,2), (1,1,3), (2,0,2), (1,-1,1), (0,0,0)),
  ((2,2,2), (1,1,3), (2,0,2), (1,1,1), (0,0,0)),
  ((2,2,2), (1,3,1), (0,2,0), (-1,1,-1), (0,0,0)),
  ((2,2,2), (1,3,1), (0,2,0), (-1,1,1), (0,0,0)),
  ((2,2,2), (1,3,1), (0,2,0), (1,1,-1), (0,0,0)),
  ((2,2,2), (1,3,1), (0,2,0), (1,1,1), (0,0,0)),
  ((2,2,2), (1,3,1), (0,2,2), (-1,1,1), (0,0,0)),
  ((2,2,2), (1,3,1), (0,2,2), (1,1,1), (0,0,0)),
  ((2,2,2), (1,3,1), (2,2,0), (1,1,-1), (0,0,0)),
  ((2,2,2), (1,3,1), (2,2,0), (1,1,1), (0,0,0)),
  ((2,2,2), (3,1,1), (2,0,0), (1,-1,-1), (0,0,0)),
  ((2,2,2), (3,1,1), (2,0,0), (1,-1,1), (0,0,0)),
  ((2,2,2), (3,1,1), (2,0,0), (1,1,-1), (0,0,0)),
  ((2,2,2), (3,1,1), (2,0,0), (1,1,1), (0,0,0)),
  ((2,2,2), (3,1,1), (2,0,2), (1,-1,1), (0,0,0)),
  ((2,2,2), (3,1,1), (2,0,2), (1,1,1), (0,0,0)),
  ((2,2,2), (3,1,1), (2,2,0), (1,1,-1), (0,0,0)),
  ((2,2,2), (3,1,1), (2,2,0), (1,1,1), (0,0,0)).

Maple

s:= proc(n) option remember;
     `if`(n=0, [[]], map(x-> seq([x[], i], i=[-1, 1]), s(n-1)))
    end:
b:= proc(l) option remember; (n-> `if`(l=[0$n], 1, add((h-> `if`(
      add(i^2, i=h)<add(i^2, i=l), b(sort(h)), 0))(l+x), x=s(n))))(nops(l))
    end:
a:= n-> b([n$3]):
seq(a(n), n=0..20);

Crossrefs

Cf. A347813.

Sequence in context: A125362 A126520 A324794 * A264493 A224419 A297864

Adjacent sequences: A348198 A348199 A348200 * A348202 A348203 A348204

Keyword

nonn,walk

Author

Alois P. Heinz, Oct 06 2021

Status

approved