|
Search: id:A148455
|
|
|
| A148455 |
|
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), (0, 1, 1), (1, 0, -1)} |
|
+0
1
|
|
| 1, 1, 2, 6, 18, 54, 189, 633, 2304, 8304, 31165, 117040, 450812, 1738597, 6832754, 26873783, 107237479, 428294527, 1729570438, 6992686966, 28512482373, 116421902463, 478533610040, 1969894917140, 8152045246384, 33786980247672, 140634663815895, 586246071077852, 2452450863163104
(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, -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: A114464 A062415 A086680 this_sequence A094590 A004529 A000778
Adjacent sequences: A148452 A148453 A148454 this_sequence A148456 A148457 A148458
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008
|
|
|
Search completed in 0.002 seconds
|
