|
Search: id:A149978
|
|
|
| A149978 |
|
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), (0, 1, 0), (1, 0, -1), (1, 0, 0)} |
|
+0
1
|
|
| 1, 2, 5, 16, 58, 221, 883, 3668, 15596, 67571, 298134, 1333912, 6030624, 27528761, 126746884, 587545554, 2739699560, 12845256385, 60510949814, 286203098987, 1358685159689, 6471768994331, 30917450082933, 148092751514563, 711095056485640, 3422022007694816, 16500729516301499, 79711807146475888
(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[-1 + 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, 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: A121689 A009225 A157612 this_sequence A149979 A019448 A000753
Adjacent sequences: A149975 A149976 A149977 this_sequence A149979 A149980 A149981
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008
|
|
|
Search completed in 0.006 seconds
|
