|
Search: id:A151085
|
|
|
| A151085 |
|
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, 1), (0, 1, 1), (1, 0, 1), (1, 1, 0)} |
|
+0
1
|
|
| 1, 3, 10, 43, 182, 803, 3635, 16537, 76742, 357427, 1678899, 7932323, 37617702, 179305425, 856913256, 4108608935, 19750080914, 95143303843, 459343861243, 2221416227189, 10761044080978, 52205865641821, 253606546956982, 1233519006840273, 6006367583321020, 29277410062467563, 142846687651530691
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
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[i, -1 + j, -1 + k, -1 + n] + aux[1 + i, 1 + 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: A143523 A042545 A151084 this_sequence A082936 A030935 A132428
Adjacent sequences: A151082 A151083 A151084 this_sequence A151086 A151087 A151088
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008
|
|
|
Search completed in 0.002 seconds
|
