Svoboda | Graniru | BBC Russia | Golosameriki | Facebook
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)

Revision History for A148959

(Underlined text is an addition; strikethrough text is a deletion.)

Showing all changes.
A148959 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, 0, 0), (0, -1, 0), (0, 1, 1), (1, 1, -1)}.
(history; published version)
#4 by Wesley Ivan Hurt at Fri Mar 29 19:46:19 EDT 2024
STATUS

editing

approved

#3 by Wesley Ivan Hurt at Fri Mar 29 19:46:18 EDT 2024
NAME

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, 0, 0), (0, -1, 0), (0, 1, 1), (1, 1, -1)})}.

STATUS

approved

editing

#2 by Russ Cox at Fri Mar 30 18:54:09 EDT 2012
AUTHOR

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

Discussion
Fri Mar 30 18:54
OEIS Server: https://oeis.org/edit/global/269
#1 by N. J. A. Sloane at Fri Jan 09 03:00:00 EST 2009
NAME

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, 0, 0), (0, -1, 0), (0, 1, 1), (1, 1, -1)}

DATA

1, 1, 3, 9, 31, 100, 370, 1372, 5290, 20266, 80361, 321735, 1307984, 5335667, 22024808, 91659114, 384509857, 1620023737, 6864307125, 29248903041, 125269708719, 538502958487, 2323193194405, 10060821504853, 43727466779310, 190618286246040, 833147784737097, 3651348013005285, 16045299842617819

OFFSET

0,3

LINKS

A. Bostan and M. Kauers, 2008. Automatic Classification of Restricted Lattice Walks, <a href="http://arxiv.org/abs/0811.2899">ArXiv 0811.2899</a>.

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[i, -1 + j, -1 + k, -1 + n] + aux[i, 1 + j, k, -1 + n] + aux[1 + i, 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}]

KEYWORD

nonn,walk

AUTHOR

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

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 6 10:36 EDT 2024. Contains 374969 sequences. (Running on oeis4.)