|
Search: id:A150936
|
|
|
| A150936 |
|
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, 1), (1, -1, 1), (1, 1, 0), (1, 1, 1)} |
|
+0
1
|
|
| 1, 2, 9, 33, 161, 680, 3369, 15088, 75081, 347064, 1730781, 8158649, 40732877, 194526790, 971772573, 4683554583, 23404834485, 113561913832, 567609536625, 2768123587989, 13837451513575, 67749630403142, 338696889044933, 1663493549344340, 8316622638737221, 40949858508495618, 204735162202289217
(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[-1 + i, -1 + 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, 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: A150933 A150934 A150935 this_sequence A109719 A000524 A120989
Adjacent sequences: A150933 A150934 A150935 this_sequence A150937 A150938 A150939
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008
|
|
|
Search completed in 0.002 seconds
|
