login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A148790 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, 0, 0), (1, -1, 0), (1, 0, 1), (1, 1, -1)} 0
1, 1, 3, 8, 25, 77, 257, 853, 2946, 10178, 36005, 127635, 459307, 1657395, 6042087, 22089132, 81346477, 300383933, 1115251580, 4151032922, 15515158110, 58122268630, 218459019113, 822782085889, 3107215915981, 11755843600909, 44576827929909, 169308082883825, 644271153070229, 2455271638906533 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

Also, number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, 1), (0, -1), (0, 1), (1, 1)}

LINKS

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

M. Bousquet-Melou and M. Mishna, 2008. Walks with small steps in the quarter plane, ArXiv 0810.4387.

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, -1 + k, -1 + n] + aux[-1 + i, 1 + j, k, -1 + n] + aux[1 + i, 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: A022553 A148789 A088327 * A148791 A148792 A007563

Adjacent sequences:  A148787 A148788 A148789 * A148791 A148792 A148793

KEYWORD

nonn,walk

AUTHOR

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

EXTENSIONS

Edited by N. J. A. Sloane (njas(AT)research.att.com), Nov 28 2008 at the suggestion of R. J. Mathar

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 18:22 EST 2012. Contains 205835 sequences.