|
Search: id:A149202
|
|
|
| A149202 |
|
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, 0), (0, 0, -1), (1, -1, 0), (1, 1, 0)} |
|
+0
1
|
|
| 1, 1, 4, 10, 39, 127, 509, 1897, 7749, 31147, 130112, 545708, 2331309, 10037789, 43719016, 191747526, 848165641, 3773572327, 16898460414, 76053411328, 344014622051, 1562892747417, 7129247628225, 32642193164425, 149968165632697, 691188094597787, 3195018422360210, 14809239529907368
(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, k, -1 + n] + aux[i, j, 1 + k, -1 + n] + aux[1 + i, -1 + 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
|
Adjacent sequences: A149199 A149200 A149201 this_sequence A149203 A149204 A149205
Sequence in context: A149201 A065524 A024689 this_sequence A151447 A149203 A038168
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008
|
|
|
Search completed in 0.002 seconds
|
