Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A148878
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A148878 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, 0), (0, 1, -1), (0, 1, 1), (1, -1, 0)} +0
1
1, 1, 3, 8, 30, 95, 373, 1337, 5491, 20879, 87823, 348878, 1495592, 6116233, 26582687, 111153122, 488390316, 2076955693, 9206018343, 39681877464, 177159455338, 772030567083, 3467620937271, 15248904120655, 68844612742745, 305061781752215, 1383396232352037, 6170031420068042, 28088366503307858 (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, k, -1 + n] + aux[i, -1 + j, -1 + k, -1 + n] + aux[i, -1 + j, 1 + k, -1 + n] + aux[1 + i, -1 + j, 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: A162054 A067354 A148877 this_sequence A148879 A148880 A148881

Adjacent sequences: A148875 A148876 A148877 this_sequence A148879 A148880 A148881

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 | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research