|
Search: id:A149032
|
|
|
| A149032 |
|
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, 0), (0, 1, 1), (1, -1, 1), (1, 0, -1)} |
|
+0
1
|
|
| 1, 1, 3, 10, 34, 124, 484, 1918, 7749, 32067, 134194, 568493, 2435542, 10508758, 45709216, 200171229, 881065532, 3898657609, 17330389586, 77335498887, 346384232095, 1556614155820, 7016113927071, 31710826763086, 143689626245311, 652614833648569, 2970428466894750, 13547453963340752
(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, j, 1 + k, -1 + n] + aux[-1 + i, 1 + j, -1 + k, -1 + n] + aux[i, -1 + j, -1 + k, -1 + n] + aux[1 + i, j, 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: A047017 A026616 A047032 this_sequence A149033 A149034 A149035
Adjacent sequences: A149029 A149030 A149031 this_sequence A149033 A149034 A149035
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008
|
|
|
Search completed in 0.002 seconds
|
