Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A148804
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A148804 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, 1), (1, 0, 1), (1, 1, -1)} +0
1
1, 1, 3, 8, 26, 83, 286, 981, 3493, 12469, 45525, 166624, 618123, 2300128, 8638210, 32528611, 123266486, 468285464, 1787276670, 6836101525, 26237809440, 100895198047, 389029486532, 1502466389904, 5814999975045, 22537930750295, 87503846935743, 340155623048742, 1324169995953546, 5160356768069861 (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, -1 + k, -1 + n] + aux[-1 + i, 1 + j, -1 + 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: A131910 A148802 A148803 this_sequence A148805 A000237 A148806

Adjacent sequences: A148801 A148802 A148803 this_sequence A148805 A148806 A148807

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 December 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research