|
Search: id:A149760
|
|
|
| A149760 |
|
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, 0, 0), (-1, 1, 1), (0, -1, 0), (0, 0, -1), (1, 1, 1)} |
|
+0
1
|
|
| 1, 1, 5, 19, 71, 287, 1227, 5225, 22533, 98501, 435789, 1937773, 8674229, 39013929, 176395377, 800429171, 3645660451, 16650259179, 76271644403, 350201421263, 1611730662275, 7431609599983, 34333249277507, 158871090135623, 736334386517187, 3417419972522207, 15882375410713987, 73900270630169779
(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[i, j, 1 + k, -1 + n] + aux[i, 1 + j, k, -1 + n] + aux[1 + i, -1 + j, -1 + k, -1 + n] + aux[1 + i, 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: A099393 A083588 A149759 this_sequence A149761 A149762 A086386
Adjacent sequences: A149757 A149758 A149759 this_sequence A149761 A149762 A149763
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008
|
|
|
Search completed in 0.002 seconds
|
