|
Search: id:A148294
|
|
|
| A148294 |
|
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), (-1, 1, 1), (0, 0, 1), (1, 0, -1)} |
|
+0
1
|
|
| 1, 1, 2, 5, 13, 35, 110, 332, 1074, 3607, 12120, 41835, 148879, 525959, 1904427, 6995590, 25659595, 95591032, 360036559, 1353702230, 5153002842, 19759502031, 75714017272, 292822792645, 1138947841638, 4427470127513, 17339998869034, 68210151850507, 268226913204807, 1061159916625160, 4213133936804945
(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[i, j, -1 + k, -1 + n] + aux[1 + 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: A148291 A148292 A148293 this_sequence A148295 A046171 A022854
Adjacent sequences: A148291 A148292 A148293 this_sequence A148295 A148296 A148297
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008
|
|
|
Search completed in 0.002 seconds
|
