|
Search: id:A149144
|
|
|
| A149144 |
|
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, 0), (-1, 1, -1), (-1, 1, 1), (0, 0, -1), (1, 0, 1)} |
|
+0
1
|
|
| 1, 1, 4, 9, 36, 116, 446, 1607, 6220, 23956, 94706, 376166, 1508378, 6097770, 24848216, 101794745, 419633188, 1735005118, 7212840484, 30073470046, 125884517868, 528435742844, 2224028504256, 9386245113832, 39695913307416, 168274735909014, 714667890556662, 3040710119604746, 12960320077616284
(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, -1 + k, -1 + n] + aux[i, 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, 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: A149141 A149142 A149143 this_sequence A149145 A001256 A029997
Adjacent sequences: A149141 A149142 A149143 this_sequence A149145 A149146 A149147
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008
|
|
|
Search completed in 0.002 seconds
|
