|
Search: id:A148106
|
|
|
| A148106 |
|
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, 0, 1), (0, 1, -1), (1, -1, 1), (1, 0, 0)} |
|
+0
1
|
|
| 1, 1, 2, 4, 10, 27, 79, 258, 843, 2884, 10206, 36727, 135231, 506297, 1931767, 7482415, 29281327, 115997541, 464211257, 1872876225, 7615571704, 31194424964, 128696451725, 534298615063, 2230435879113, 9361460673715, 39485798360364, 167275262629363, 711528823024754, 3038494468031414
(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, j, k, -1 + n] + aux[-1 + i, 1 + j, -1 + k, -1 + n] + aux[i, -1 + j, 1 + k, -1 + n] + aux[1 + i, 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: A114507 A148105 A127386 this_sequence A099950 A121690 A138356
Adjacent sequences: A148103 A148104 A148105 this_sequence A148107 A148108 A148109
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008
|
|
|
Search completed in 0.002 seconds
|
