Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A149655
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A149655
%S A149655 1,1,5,15,75,289,1445,6095,30475,135117,675585,3087987,15439935,72008619,
               360043095,1703029437,
%T A149655 8515147185,40694381623,203471908115,979988489573,4899942447865,23742016308033,
               118710081540165,
%U A149655 577930415357795,2889652076788975,14121788791089079,70608943955445395,
               346141784385418635
%N A149655 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, 1, 1), 
               (1, -1, 1), (1, 1, -1), (1, 1, 1)}
%H A149655 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 A149655 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, -1 + k, -1 + n] + aux[-1 
               + i, -1 + j, 1 + k, -1 + n] + aux[-1 + i, 1 + j, -1 + k, -1 + n] 
               + aux[1 + i, -1 + j, -1 + 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 A149655 Sequence in context: A101553 A149653 A149654 this_sequence A032122 A064678 
               A088935
%Y A149655 Adjacent sequences: A149652 A149653 A149654 this_sequence A149656 A149657 
               A149658
%K A149655 nonn,walk
%O A149655 0,3
%A A149655 Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008

    
page 1

Search completed in 0.001 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 4 23:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research