|
Search: id:A150013
|
|
|
| A150013 |
|
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, 0), (-1, -1, 1), (0, 1, -1), (0, 1, 1), (1, 0, 0)} |
|
+0
1
|
|
| 1, 2, 5, 17, 65, 237, 967, 3984, 16160, 68745, 296712, 1262510, 5540252, 24489806, 107196022, 478859777, 2150448033, 9584178330, 43349477053, 196821411031, 888311338529, 4054202839269, 18556916269822, 84530021363135, 388430674507119, 1788984148930394, 8206817078963654, 37913828922747116
(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, j, k, -1 + n] + aux[i, -1 + j, -1 + k, -1 + n] + aux[i, -1 + j, 1 + k, -1 + n] + aux[1 + i, 1 + j, -1 + k, -1 + n] + aux[1 + i, 1 + j, 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: A109084 A090902 A150012 this_sequence A123166 A052539 A008932
Adjacent sequences: A150010 A150011 A150012 this_sequence A150014 A150015 A150016
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008
|
|
|
Search completed in 0.002 seconds
|
