|
%I #4 Dec 04 2016 13:56:59
%S 1,2,5,15,47,150,495,1672,5698,19636,68470,240342,848258,3012899,
%T 10753669,38519879,138501666,499728140,1807946861,6557502077,
%U 23843549009,86880613032,317170036587,1160001218633,4249640363945,15591664759190,57285869534363,210757677563396,776332308628500,2862899274870651
%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), (0, 1), (1, 0)}
%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, j, -1 + n] + aux[i, -1 + j, -1 + n] + aux[1 + i, -1 + 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}]
%K nonn,walk
%O 0,2
%A _Manuel Kauers_, Nov 18 2008
|
