The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #5 Dec 04 2016 13:56:59
%S 1,1,6,19,92,380,1858,8531,42322,205486,1036242,5197028,26600656,
%T 136247450,706258300,3671453391,19233967034,101105026444,534364343102,
%U 2833591923458,15087564248648,80576221523390,431730827926256,2319409832695016,12494373170976880,67463786953484884,365108831177564780
%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), (1, 1)}
%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>.
%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>.
%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, 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}]
%K nonn,walk
%O 0,3
%A _Manuel Kauers_, Nov 18 2008