OFFSET
0,2
LINKS
A. Bostan, Computer Algebra for Lattice Path Combinatorics, Seminaire de Combinatoire Ph. Flajolet, March 28 2013.
Alin Bostan, Calcul Formel pour la Combinatoire des Marches [The text is in English], Habilitation à Diriger des Recherches, Laboratoire d’Informatique de Paris Nord, Université Paris 13, December 2017.
Bostan, Alin ; Chyzak, Frédéric; van Hoeij, Mark; Kauers, Manuel; Pech, Lucien Hypergeometric expressions for generating functions of walks with small steps in the quarter plane. Eur. J. Comb. 61, 242-275 (2017)
A. Bostan and M. Kauers, Automatic Classification of Restricted Lattice Walks, arXiv:0811.2899 [math.CO], 2008-2009.
M. Bousquet-Mélou and M. Mishna, Walks with small steps in the quarter plane, arXiv:0810.4387 [math.CO], 2008-2009.
FORMULA
G.f.: Int(Int(x*(3*x+1)*(-4+Int(2*(1-2*x-15*x^2)^(3/2)*((4*x^2-1)*(92*x^4+76*x^3+43*x^2+6*x+1)*hypergeom([7/4, 9/4],[2],64*x^3*(1+x)/(1-4*x^2)^2)+14*x^3*(10*x+1)*(18*x^3+7*x^2+3*x-1)*hypergeom([9/4, 11/4],[3],64*x^3*(1+x)/(1-4*x^2)^2))/((3*x+1)*(1-4*x^2)^(9/2)*x^2),x))/(1-2*x-15*x^2)^(5/2),x),x)/x^2. - Mark van Hoeij, Aug 16 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, j, -1 + n] + aux[-1 + i, 1 + j, -1 + n] + aux[i, -1 + j, -1 + n] + aux[1 + i, j, -1 + n] + aux[1 + i, 1 + j, -1 + n]]; Table[Sum[aux[i, j, n], {i, 0, n}, {j, 0, n}], {n, 0, 25}]
CROSSREFS
KEYWORD
nonn,walk
AUTHOR
Manuel Kauers, Nov 18 2008
STATUS
approved