|
Search: id:A149165
|
|
|
| A149165 |
|
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, 1), (-1, 1, 1), (1, -1, -1), (1, 1, 0)} |
|
+0
1
|
|
| 1, 1, 4, 9, 41, 121, 564, 1898, 8998, 32554, 156240, 592929, 2866956, 11256910, 54711837, 220307006, 1074842238, 4413112774, 21592348681, 90038673397, 441513104951, 1864452719636, 9158651736488, 39082877245462, 192260900527113, 827716023610037, 4076664109196259, 17683747991284705
(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, 1 + j, 1 + k, -1 + n] + aux[1 + i, -1 + j, -1 + k, -1 + n] + aux[1 + i, j, -1 + 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: A041229 A042887 A053908 this_sequence A083859 A070761 A149166
Adjacent sequences: A149162 A149163 A149164 this_sequence A149166 A149167 A149168
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008
|
|
|
Search completed in 0.003 seconds
|
