The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A151378 Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, 0), (0, 1), (1, -1)}. 0
1, 1, 1, 2, 4, 7, 16, 37, 78, 191, 472, 1091, 2784, 7152, 17460, 45788, 120682, 305441, 816698, 2192203, 5691926, 15441378, 42019320, 111194238, 305061352, 839027467, 2253118896, 6237085427, 17301189778, 47005703891, 131077143762, 366148478721, 1004274998298, 2817566773469, 7916593883722, 21885125128391 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
M. Bousquet-Mélou and M. Mishna, Walks with small steps in the quarter plane, arXiv:0810.4387 [math.CO], 2008.
FORMULA
G.f.: (1+x)^(1/2)*(1-3*x)^(3/2)*Int((hypergeom([-2/3,-1/3],[1],27*x^3)-1+4*x*(hypergeom([-1/3,1/3],[2],27*x^3)-1)+9*x^2)/(3*(1+x)^(3/2)*(1-3*x)^(5/2)),x)/x^3. - Mark van Hoeij, Aug 25 2014
MATHEMATICA
aux[i_Integer, j_Integer, n_Integer] := Which[Min[i, j, n] < 0 || Max[i, j] > n, 0, n == 0, KroneckerDelta[i, j, n], True, aux[i, j, n] = aux[-1 + i, 1 + j, -1 + n] + aux[i, -1 + j, -1 + n] + aux[1 + i, j, -1 + n]]; Table[Sum[aux[0, k, n], {k, 0, n}], {n, 0, 25}]
CROSSREFS
Sequence in context: A259545 A319559 A260790 * A192464 A360885 A343869
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 13 03:04 EDT 2024. Contains 372497 sequences. (Running on oeis4.)