# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a148353
Showing 1-1 of 1

%I A148353 #4 Jan 01 2024 00:47:08
%S A148353 1,1,2,5,15,44,154,514,1949,7100,28289,109269,450989,1814897,7692208,
%T A148353 31909424,138042852,586240058,2577374384,11152156893,49670880217,
%U A148353 218216089703,982348019505,4370272299508,19850169852979,89244498210728,408439137023100,1852782584365454,8534857228606366
%N A148353 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, -1, 1), (-1, 0, 1), (1, 0, -1), (1, 0, 0), (1, 1, -1)}.
%H A148353 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 A148353 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, j, k, -1 + n] + aux[-1 + i, j, 1 + 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}]
%K A148353 nonn,walk
%O A148353 0,3
%A A148353 _Manuel Kauers_, Nov 18 2008

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE