A151292 - OEIS

%I #23 Aug 06 2024 04:53:49

%S 1,2,7,23,85,314,1207,4682,18493,73688,296671,1202849,4910689,

%T 20158436,83169871,344628527,1433631973,5984532728,25060514887,

%U 105240685511,443102517025,1870054761632,7909539602647,33521289826778,142330494633985,605375433105734,2578988979186127,11003364185437517

%N Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0) and consisting of n steps taken from {(-1, -1), (-1, 1), (-1, 0), (0, 1), (1, 1)}

%H A. Bostan, <a href="https://citeseerx.ist.psu.edu/pdf/749aef4c6f3668e652b5074e5268346ccecc88c9">Computer Algebra for Lattice Path Combinatorics</a>, Seminaire de Combinatoire Ph. Flajolet, March 28 2013.

%H A. Bostan and M. Kauers, <a href="http://arxiv.org/abs/0811.2899">Automatic Classification of Restricted Lattice Walks</a>, arXiv:0811.2899 [math.CO], 2008-2009.

%H Alin Bostan, Andrew Elvey Price, Anthony John Guttmann, and Jean-Marie Maillard, <a href="https://arxiv.org/abs/2001.00393">Stieltjes moment sequences for pattern-avoiding permutations</a>, arXiv:2001.00393 [math.CO], 2020.

%H M. Bousquet-Mélou and M. Mishna, <a href="http://arxiv.org/abs/0810.4387">Walks with small steps in the quarter plane</a>, arXiv:0810.4387 [math.CO], 2008-2009.

%H Xiang-Ke Chang, X.-B. Hu, H. Lei, and Y.-N. Yeh, <a href="https://doi.org/10.37236/4793">Combinatorial proofs of addition formulas</a>, The Electronic Journal of Combinatorics, 23(1) (2016), #P1.8.

%t 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, -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}]

%Y CF. A151290 (similar for N^3).

%K nonn,walk

%O 0,2

%A _Manuel Kauers_, Nov 18 2008