|
Search: id:A148102
|
|
|
| A148102 |
|
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), (0, 0, 1), (0, 1, -1), (1, -1, 0)} |
|
+0
1
|
|
| 1, 1, 2, 4, 10, 26, 77, 236, 741, 2430, 8179, 28208, 99475, 356501, 1296199, 4783652, 17871126, 67465415, 257298969, 989810000, 3838658082, 15001356476, 59013879343, 233616780902, 930237304959, 3723778727143, 14981506373914, 60554119697080, 245812410995518, 1001928721763590, 4099422669401518
(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[i, -1 + j, 1 + k, -1 + n] + aux[i, 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: A149818 A148101 A052854 this_sequence A096807 A003239 A116673
Adjacent sequences: A148099 A148100 A148101 this_sequence A148103 A148104 A148105
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008
|
|
|
Search completed in 0.003 seconds
|
