|
Search: id:A149233
|
|
|
| A149233 |
|
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), (0, 1, -1), (1, 0, -1), (1, 1, 1)} |
|
+0
1
|
|
| 1, 1, 4, 11, 32, 110, 360, 1195, 4144, 14386, 49928, 175670, 625360, 2217916, 7928624, 28528467, 102759712, 371080938, 1345548072, 4892984610, 17803931984, 64981731748, 237693327312, 870395679966, 3192368750176, 11729242090996, 43154714474832, 158912472263628, 586051248304416, 2163755202849400
(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, j, 1 + k, -1 + n] + aux[i, -1 + 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: A052545 A025268 A149232 this_sequence A034745 A099159 A116394
Adjacent sequences: A149230 A149231 A149232 this_sequence A149234 A149235 A149236
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008
|
|
|
Search completed in 0.002 seconds
|
