|
Search: id:A151125
|
|
|
| A151125 |
|
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), (1, 0, 1), (1, 1, 0)} |
|
+0
1
|
|
| 1, 3, 11, 45, 195, 855, 3859, 17664, 81534, 380118, 1785231, 8421649, 39941158, 190204244, 908487667, 4353177705, 20914598678, 100694137234, 485839187516, 2348481826887, 11369957309370, 55131637668280, 267694529100150, 1301363943139225, 6333801895412544, 30859564496858068, 150496855039572611
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
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, 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: A151122 A151123 A151124 this_sequence A151126 A151127 A026375
Adjacent sequences: A151122 A151123 A151124 this_sequence A151126 A151127 A151128
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008
|
|
|
Search completed in 0.002 seconds
|
