The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A149328 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, 0), (0, 1, -1), (1, 0, -1), (1, 0, 1)}. 0
 1, 1, 4, 12, 39, 142, 545, 2106, 8382, 34215, 142643, 600014, 2557631, 11028505, 48020121, 210769413, 931363949, 4143384678, 18544445680, 83436432216, 377186393627, 1712438625809, 7806272131532, 35718243832372, 163985930358341, 755228559001683, 3488271916047151, 16155889488916942 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Table of n, a(n) for n=0..27. 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[-1 + i, j, 1 + k, -1 + n] + aux[i, -1 + j, 1 + k, -1 + n] + aux[1 + i, j, 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: A334458 A122920 A241073 * A149329 A149330 A149331 Adjacent sequences: A149325 A149326 A149327 * A149329 A149330 A149331 KEYWORD nonn,walk AUTHOR Manuel Kauers, Nov 18 2008 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 3 21:27 EDT 2024. Contains 374905 sequences. (Running on oeis4.)