|
Search: id:A148495
|
|
|
| A148495 |
|
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, 0, 1), (-1, 1, 1), (0, 1, 0), (1, -1, 1), (1, 1, -1)} |
|
+0
1
|
|
| 1, 1, 2, 6, 21, 83, 348, 1499, 6623, 29805, 136080, 628537, 2930993, 13772875, 65132877, 309654749, 1478735723, 7088395315, 34089167561, 164401035964, 794796779867, 3850714202599, 18691819399273, 90885695919131, 442583806441116, 2158167279743194, 10536761139563128, 51500580609300347
(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, -1 + j, k, -1 + n] + aux[1 + i, -1 + j, -1 + k, -1 + n] + aux[1 + i, 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: A150220 A032347 A032346 this_sequence A150221 A063689 A058866
Adjacent sequences: A148492 A148493 A148494 this_sequence A148496 A148497 A148498
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008
|
|
|
Search completed in 0.002 seconds
|
