The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A148005 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, 0, 1), (-1, 1, -1), (1, 0, 0)}. 1
 1, 1, 2, 3, 8, 15, 44, 91, 286, 633, 2072, 4796, 16180, 38727, 133548, 327895, 1150226, 2881857, 10247072, 26099008, 93830568, 242264113, 878987980, 2295723288, 8393889812, 22139557300, 81484257064, 216757035756, 802324361696, 2150196732767, 7998562017700, 21576806128743, 80615634684738 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS A. Bostan and M. Kauers, Automatic Classification of Restricted Lattice Walks, arXiv:0811.2899 [math.CO], 2008. FORMULA G.f.: (1-4*x)^(1/2)*(2*x-1)*Int(x*(1+((3*x-1)*(2*x+1)*hypergeom([1/2, 3/2],[3],16*x^2/(1+4*x^2))-2*x^2*(2*x-1)*hypergeom([3/2, 3/2],[4],16*x^2/(1+4*x^2)))/((1+4*x^2)^(1/2)*(2*x-1)^2))/(1-4*x)^(3/2),x)/x^3. - Mark van Hoeij, Aug 27 2014 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, -1 + j, 1 + k, -1 + n] + aux[1 + i, 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: A300443 A321231 A156802 * A151394 A148006 A148007 Adjacent sequences:  A148002 A148003 A148004 * A148006 A148007 A148008 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 17 18:07 EDT 2021. Contains 343986 sequences. (Running on oeis4.)