Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A148059
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A148059 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, 0), (-1, -1, 1), (-1, 1, 0), (1, 0, 0), (1, 1, -1)} +0
1
1, 1, 2, 3, 10, 22, 71, 174, 653, 1814, 6915, 20546, 82095, 257809, 1056914, 3465493, 14500386, 49162222, 209454739, 730286285, 3154572233, 11256937646, 49204919325, 179067026571, 790635748409, 2926364462640, 13031956988866, 48947868670643, 219613554134575, 835550047444947, 3773438077994772 (list; graph; listen)
OFFSET

0,3

LINKS

A. Bostan and M. Kauers, 2008. Automatic Classification of Restricted Lattice Walks, ArXiv 0811.2899.

MATHEMATICA

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, j, k, -1 + n] + aux[1 + i, -1 + j, k, -1 + n] + aux[1 + i, 1 + j, -1 + k, -1 + n] + aux[1 + i, 1 + j, k, -1 + n]]; Table[Sum[aux[i, j, k, n], {i, 0, n}, {j, 0, n}, {k, 0, n}], {n, 0, 10}]

CROSSREFS

Sequence in context: A148056 A148057 A148058 this_sequence A089880 A130002 A162034

Adjacent sequences: A148056 A148057 A148058 this_sequence A148060 A148061 A148062

KEYWORD

nonn,walk

AUTHOR

Manuel Kauers (manuel(AT)kauers.de), Nov 18 2008

page 1

Search completed in 0.002 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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 19 01:26 EDT 2010. Contains 173632 sequences.


AT&T Labs Research