|
Search: id:A148807
|
|
|
| A148807 |
|
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, 0), (0, 0, 1), (1, 0, -1), (1, 1, -1)} |
|
+0
1
|
|
| 1, 1, 3, 8, 26, 84, 310, 1124, 4308, 16899, 67411, 274117, 1133883, 4734386, 20046775, 85635245, 368968792, 1603346851, 7012855376, 30873802596, 136729416911, 608572823741, 2722341370871, 12231245323761, 55177536688849, 249879755863802, 1135534288711325, 5177282932102486, 23677329377330933
(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, 1 + k, -1 + n] + aux[-1 + i, j, 1 + k, -1 + n] + aux[i, j, -1 + k, -1 + n] + aux[1 + i, 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: A148805 A000237 A148806 this_sequence A148808 A148809 A151457
Adjacent sequences: A148804 A148805 A148806 this_sequence A148808 A148809 A148810
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008
|
|
|
Search completed in 0.002 seconds
|
