Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
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, 0), (1, -1), (1, 0), (1, 1)}.
0

%I #6 Dec 27 2023 21:39:01

%S 1,2,9,34,161,690,3340,15127,74025,345350,1700641,8078534,39940239,

%T 191998427,951780628,4613430423,22912945993,111732959607,555692292248,

%U 2722027662579,13551646056826,66612271878273,331891009874753,1635825684723348,8155387103254651,40283455920402930,200930087609072285

%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, 0), (1, -1), (1, 0), (1, 1)}.

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

%H A. Bostan and M. Kauers, 2008. Automatic Classification of Restricted Lattice Walks, <a href="http://arxiv.org/abs/0811.2899">ArXiv 0811.2899</a>.

%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[-1 + i, j, -1 + n] + aux[-1 + i, 1 + j, -1 + n] + aux[1 + i, -1 + j, -1 + n] + aux[1 + i, j, -1 + n]]; Table[Sum[aux[i, j, n], {i, 0, n}, {j, 0, n}], {n, 0, 25}]

%K nonn,walk

%O 0,2

%A _Manuel Kauers_, Nov 18 2008