|
Search: id:A148439
|
|
|
| A148439 |
|
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), (0, 0, -1), (0, 1, -1), (1, 0, -1), (1, 1, 0)} |
|
+0
1
|
|
| 1, 1, 2, 6, 15, 43, 143, 447, 1457, 5153, 17712, 62226, 228307, 826403, 3045356, 11463886, 42915761, 163162575, 626421084, 2403106726, 9332107293, 36397643689, 142264226087, 560927157537, 2216454163673, 8789867068979, 35060453041676, 140072687401512, 561842105897395, 2261924959908545
(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, k, -1 + n] + aux[-1 + i, j, 1 + k, -1 + n] + aux[i, -1 + j, 1 + k, -1 + n] + aux[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: A139379 A065178 A148438 this_sequence A151515 A052870 A001444
Adjacent sequences: A148436 A148437 A148438 this_sequence A148440 A148441 A148442
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008
|
|
|
Search completed in 0.004 seconds
|
