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

%I #8 Dec 27 2023 21:33:09

%S 1,0,2,4,16,64,266,1210,5630,27338,136182,695270,3622134,19202912,

%T 103375978,564014502,3114100008,17377324802,97897946434,556290574936,

%U 3185821992528,18375238184570,106677854854822,623039452424644,3658928077976048,21597785683494184,128091748188993146,763037745974345554

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

%H A. Bostan, K. Raschel, B. Salvy, <a href="http://dx.doi.org/10.1016/j.jcta.2013.09.005">Non-D-finite excursions in the quarter plane</a>, J. Comb. Theory A 121 (2014) 45-63, Table 1 Tag 55, Tag 56.

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

%K nonn,walk

%O 0,3

%A _Manuel Kauers_, Nov 18 2008