editing
approved
editing
approved
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, -1, 0), (-1, 0, -1), (1, -1, 0), (1, 1, 1)}.
approved
editing
_Manuel Kauers (manuel(AT)kauers.de), _, Nov 18 2008
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, -1, 0), (-1, 0, -1), (1, -1, 0), (1, 1, 1)}
1, 1, 5, 11, 47, 143, 577, 2003, 8189, 29843, 124237, 467583, 1960681, 7577163, 31962501, 125734635, 534229159, 2128096227, 9092397583, 36615310761, 157023171309, 638232284475, 2746009559707, 11244568651801, 48528835473245, 199957782233787, 865169500080713, 3584439532293331
0,3
A. Bostan and M. Kauers, 2008. Automatic Classification of Restricted Lattice Walks, <a href="http://arxiv.org/abs/0811.2899">ArXiv 0811.2899</a>.
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, k, -1 + n] + aux[1 + i, j, 1 + k, -1 + n] + aux[1 + i, 1 + j, 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}]
nonn,walk
Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008
approved