|
Search: id:A148133
|
|
|
| A148133 |
|
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, 0), (0, 1, -1), (0, 1, 0), (1, -1, 0)} |
|
+0
1
|
|
| 1, 1, 2, 4, 11, 28, 79, 232, 736, 2295, 7511, 25302, 86950, 300370, 1065759, 3839576, 13953744, 51197935, 190807055, 717234202, 2712764266, 10353167908, 39891162812, 154541802382, 602000096362, 2362123596696, 9324852880747, 36963162522470, 147246486670901, 589797809248183, 2372248128513882
(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[i, -1 + j, k, -1 + n] + aux[i, -1 + j, 1 + k, -1 + n] + aux[1 + i, 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}]
|
|
CROSSREFS
|
Sequence in context: A148132 A032101 A005200 this_sequence A148134 A151425 A148135
Adjacent sequences: A148130 A148131 A148132 this_sequence A148134 A148135 A148136
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008
|
|
|
Search completed in 0.002 seconds
|
