|
Search: id:A150453
|
|
|
| A150453 |
|
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, 0, -1), (0, 1, 0), (1, 1, 1)} |
|
+0
1
|
|
| 1, 2, 7, 25, 95, 376, 1523, 6290, 26373, 111886, 479365, 2070771, 9008071, 39423578, 173448057, 766653471, 3402677801, 15158156612, 67751162313, 303735992197, 1365425697699, 6153622483468, 27796881592189, 125830507827952, 570731294883201, 2593415906726304, 11804642094167071, 53817646415676925
(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, -1 + k, -1 + n] + aux[i, -1 + j, k, -1 + n] + aux[i, 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: A074605 A108081 A116396 this_sequence A150454 A150455 A150456
Adjacent sequences: A150450 A150451 A150452 this_sequence A150454 A150455 A150456
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008
|
|
|
Search completed in 0.002 seconds
|
