|
Search: id:A149207
|
|
|
| A149207 |
|
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, 0), (-1, 0, -1), (-1, 0, 1), (1, -1, 1), (1, 1, 0)} |
|
+0
1
|
|
| 1, 1, 4, 10, 40, 129, 549, 1933, 8502, 31708, 142109, 549108, 2494264, 9891529, 45352455, 183421419, 847068443, 3478366440, 16154265409, 67150019188, 313261541733, 1315277095648, 6158394389696, 26075273852257, 122461840619532, 522243214701570, 2459029674132398, 10551608705702006
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
LINKS
|
A. Bostan and M. Kauers, 2008. Automatic Classification of Restricted Lattice Walks, ArXiv 0811.2899.
|
|
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, k, -1 + n] + aux[-1 + i, 1 + j, -1 + k, -1 + n] + aux[1 + i, j, -1 + k, -1 + n] + aux[1 + i, j, 1 + k, -1 + n] + aux[1 + i, 1 + j, k, -1 + n]]; Table[Sum[aux[i, j, k, n], {i, 0, n}, {j, 0, n}, {k, 0, n}], {n, 0, 10}]
|
|
CROSSREFS
|
Sequence in context: A149204 A149205 A149206 this_sequence A156798 A149208 A149209
Adjacent sequences: A149204 A149205 A149206 this_sequence A149208 A149209 A149210
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008
|
|
|
Search completed in 0.002 seconds
|
