Search: id:A149266
Results 1-1 of 1 results found.

%I A149266
%S A149266 1,1,4,11,40,145,557,2204,8878,36670,153158,649421,2779083,12009927,52301065,
               229322103,
%T A149266 1011602788,4485941698,19989047298,89445085086,401786301272,1811068535817,
               8189394966213,
%U A149266 37138317913733,168865708226573,769695000793202,3516190063129191,16096483440690982
%N A149266 Number of walks within N^3 (the first octant of Z^3) starting at (0,0,
               0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), 
               (0, -1, 1), (1, 0, -1), (1, 1, 0)}
%H A149266 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 A149266 aux[i_Integer, j_Integer, k_Integer, n_Integer] := Which[Min[i, j, k, 
               n] < 0 || Max[i, j, k] > n, 0, n == 0, KroneckerDelta[i, j, k, n], 
               True, aux[i, j, k, n] = aux[-1 + i, -1 + j, k, -1 + n] + aux[-1 + 
               i, j, 1 + k, -1 + n] + aux[i, 1 + j, -1 + k, -1 + n] + aux[1 + i, 
               j, k, -1 + n] + aux[1 + i, 1 + j, -1 + k, -1 + n]]; Table[Sum[aux[i, 
               j, k, n], {i, 0, n}, {j, 0, n}, {k, 0, n}], {n, 0, 10}]
%Y A149266 Sequence in context: A149263 A149264 A149265 this_sequence A149267 A149268 
               A077236
%Y A149266 Adjacent sequences: A149263 A149264 A149265 this_sequence A149267 A149268 
               A149269
%K A149266 nonn,walk
%O A149266 0,3
%A A149266 Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008

Search completed in 0.001 seconds