|
Search: id:A149089
|
|
|
| A149089 |
|
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, -1, 1), (-1, 0, 1), (1, 1, 0)} |
|
+0
1
|
|
| 1, 1, 4, 7, 32, 68, 320, 747, 3588, 8884, 43112, 111054, 542840, 1439280, 7068896, 19157363, 94420380, 260343268, 1286463464, 3596962122, 17809428792, 50372422384, 249792782560, 713390782142, 3542022471496, 10199612069128, 50692207741840, 147016742815612, 731273455228208, 2134040173232352
(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, j, -1 + k, -1 + n] + aux[1 + i, 1 + 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}]
|
|
CROSSREFS
|
Sequence in context: A123801 A156228 A000289 this_sequence A004031 A153062 A143547
Adjacent sequences: A149086 A149087 A149088 this_sequence A149090 A149091 A149092
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008
|
|
|
Search completed in 0.002 seconds
|
