OFFSET
0,3
LINKS
Robert Israel, Table of n, a(n) for n = 0..200
A. Bostan and M. Kauers, Automatic Classification of Restricted Lattice Walks, arXiv:0811.2899 [math.CO], 2008-2009.
MAPLE
Steps:= [[-1, -1, -1], [-1, 0, 1], [0, 1, 0], [1, -1, 1], [1, 1, -1]]:
f:= proc(n, p) option remember; local t;
if n <= min(p) then return 5^n fi;
add(procname(n-1, t), t=remove(has, map(`+`, Steps, p), -1));
end proc: map(f, [$0..40], [0, 0, 0]); # Robert Israel, Dec 26 2018
MATHEMATICA
aux[i_Integer, j_Integer, k_Integer, n_Integer] := Which[Min[i, j, k, n] < 0 || Max[i, j, k] > n, 0, n == 0, KroneckerDelta[i, j, k, n], True, aux[i, j, k, n] = aux[-1 + i, -1 + j, 1 + k, -1 + n] + aux[-1 + i, 1 + j, -1 + k, -1 + n] + aux[i, -1 + j, k, -1 + n] + aux[1 + i, j, -1 + k, -1 + n] + aux[1 + i, 1 + j, 1 + k, -1 + n]]; Table[Sum[aux[i, j, k, n], {i, 0, n}, {j, 0, n}, {k, 0, n}], {n, 0, 10}]
CROSSREFS
KEYWORD
nonn,walk
AUTHOR
Manuel Kauers, Nov 18 2008
STATUS
approved