|
Search: id:A149531
|
|
|
| A149531 |
|
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, -1), (1, 1, 1)} |
|
+0
1
|
|
| 1, 1, 5, 11, 55, 167, 835, 2857, 14285, 52561, 262805, 1013105, 5065525, 20180161, 100900805, 411873731, 2059368655, 8565364651, 42826823255, 180795858315, 903979291575, 3862606377623, 19313031888115, 83352807019527, 416764035097635, 1813923288348959, 9069616441744795, 39759273865609487
(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[-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] + 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: A149528 A149529 A149530 this_sequence A083860 A141496 A060358
Adjacent sequences: A149528 A149529 A149530 this_sequence A149532 A149533 A149534
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008
|
|
|
Search completed in 0.002 seconds
|
