|
Search: id:A148290
|
|
|
| A148290 |
|
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, 1, 1), (1, 0, -1)} |
|
+0
1
|
|
| 1, 1, 2, 5, 13, 34, 102, 304, 925, 2930, 9356, 30311, 99822, 331596, 1112254, 3760716, 12814621, 43943067, 151483760, 525294768, 1829733893, 6399076740, 22474998817, 79217132995, 280099122391, 993531937083, 3534287684677, 12604497105919, 45063361029910, 161487916713614, 579923511283958, 2086743518925658
(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, 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: A062465 A064780 A148289 this_sequence A029885 A114298 A112839
Adjacent sequences: A148287 A148288 A148289 this_sequence A148291 A148292 A148293
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008
|
|
|
Search completed in 0.002 seconds
|
