|
Search: id:A148280
|
|
|
| A148280 |
|
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), (-1, 1, 1), (1, 0, 0), (1, 1, -1)} |
|
+0
1
|
|
| 1, 1, 2, 4, 16, 46, 193, 622, 2701, 9325, 42182, 154184, 711849, 2705836, 12670859, 49549930, 234642749, 938567225, 4481414935, 18256143420, 87727604158, 362745516847, 1752161026619, 7335659037548, 35582376864192, 150551110627071, 732790706277408, 3128696622216073, 15272684090284663
(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, k, -1 + n] + aux[1 + 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: A110128 A148279 A101061 this_sequence A112638 A077162 A128903
Adjacent sequences: A148277 A148278 A148279 this_sequence A148281 A148282 A148283
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008
|
|
|
Search completed in 0.002 seconds
|
