|
Search: id:A148329
|
|
|
| A148329 |
|
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, 0, 1), (1, -1, -1), (1, 1, -1)} |
|
+0
1
|
|
| 1, 1, 2, 5, 14, 42, 132, 427, 1461, 5149, 18208, 66167, 245809, 916554, 3472325, 13336423, 51381259, 200314770, 788549887, 3109894305, 12375535543, 49619709706, 199200086118, 805276630442, 3274867775817, 13330519836543, 54567851023957, 224455435083738, 923884816807443, 3820535590726406
(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, 1 + k, -1 + n] + aux[-1 + i, 1 + j, 1 + k, -1 + n] + aux[i, 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: A036767 A061922 A162746 this_sequence A024175 A152226 A054393
Adjacent sequences: A148326 A148327 A148328 this_sequence A148330 A148331 A148332
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008
|
|
|
Search completed in 0.002 seconds
|
