|
Search: id:A064036
|
|
|
| A064036 |
|
Number of walks of length n on cubic lattice, starting at origin, staying in first (nonnegative) octant. |
|
+0
3
|
|
| 1, 3, 12, 51, 234, 1110, 5460, 27405, 140490, 729918, 3845016, 20447658, 109801692, 593806356, 3234529584, 17715445605, 97567971930, 539701180590, 2998595422680
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
LINKS
|
R. K. Guy, Catwalks, Sandsteps and Pascal Pyramids, J. Integer Seqs., Vol. 3 (2000), #00.1.6
|
|
FORMULA
|
a(n) =sum_j[C(n, j)B(j)B(j+1)B(n-j)] where B(k)=C(k, [k/2])=A001405(k)
E.g.f.: (BesselI(0, 2*x)+BesselI(1, 2*x))^3. - Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 28 2003
|
|
EXAMPLE
|
a(2)=12 since a(1) is obviously 3 and from each of these three positions there are four possible steps which remain in the first octant.
|
|
CROSSREFS
|
Cf. A064037. The two- and one-dimensional equivalents are A005566 and A001405. With no restriction on the walks, the number is 6^n, i.e. A000400.
Sequence in context: A151187 A151188 A151189 this_sequence A125187 A151190 A151191
Adjacent sequences: A064033 A064034 A064035 this_sequence A064037 A064038 A064039
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Henry Bottomley (se16(AT)btinternet.com), Aug 23 2001
|
|
|
Search completed in 0.002 seconds
|
