The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #4 Jan 20 2024 14:15:29
%S 1,1,3,11,39,155,639,2685,11659,51415,230181,1042189,4767683,21999127,
%T 102190479,477697337,2244781469,10597607643,50235495945,238990143211,
%U 1140630445769,5459534054075,26199537164759,126021641896975,607457870715145,2933760183673987,14193780496451361,68781552133917699
%N Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (-1, 1, 1), (0, 1, 1), (1, -1, 0), (1, 0, -1)}.
%H A. Bostan and M. Kauers, 2008. Automatic Classification of Restricted Lattice Walks, <a href="http://arxiv.org/abs/0811.2899">ArXiv 0811.2899</a>.
%t 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, j, 1 + k, -1 + n] + aux[-1 + i, 1 + j, k, -1 + n] + aux[i, -1 + j, -1 + k, -1 + n] + aux[1 + i, -1 + j, -1 + k, -1 + n] + aux[1 + i, j, k, -1 + n]]; Table[Sum[aux[i, j, k, n], {i, 0, n}, {j, 0, n}, {k, 0, n}], {n, 0, 10}]
%K nonn,walk
%O 0,3
%A _Manuel Kauers_, Nov 18 2008