|
Search: id:A064044
|
|
|
| A064044 |
|
Square array read by antidiagonals of number of length k walks on an n-dimensional hypercubic lattice starting at the origin and staying in the nonnegative part. |
|
+0
4
|
|
| 1, 0, 1, 0, 1, 1, 0, 2, 2, 1, 0, 3, 6, 3, 1, 0, 6, 18, 12, 4, 1, 0, 10, 60, 51, 20, 5, 1, 0, 20, 200, 234, 108, 30, 6, 1, 0, 35, 700, 1110, 624, 195, 42, 7, 1, 0, 70, 2450, 5460, 3760, 1350, 318, 56, 8, 1, 0, 126, 8820, 27405, 23480, 9770, 2556, 483, 72, 9, 1, 0, 252
(list; table; graph; listen)
|
|
|
OFFSET
|
0,8
|
|
|
COMMENT
|
E.g.f. of row n equals ( besseli(0,2*y) + y*besseli(1,2*y) )^n. - Paul D. Hanna (pauldhanna(AT)juno.com), Apr 07 2005
|
|
LINKS
|
R. K. Guy, Catwalks, Sandsteps and Pascal Pyramids, J. Integer Seqs., Vol. 3 (2000), #00.1.6
|
|
FORMULA
|
a(n, k) = sum{j = 0, ..., k}[C(k, j)B(j)a(n-1, k-j)] where B(j) = C(j, [j/2]) = A001405(j) with a(0, 0) = 1
E.g.f: 1/(1 - x*besseli(0, 2*y) - x*y*besseli(1, 2*y)). - Paul D. Hanna (pauldhanna(AT)juno.com), Apr 07 2005
|
|
EXAMPLE
|
Rows start: {1, 0, 0, 0, 0,...}, {1, 1, 2, 3, 6,...}, {1, 2, 6, 18, 60,...}, {1, 3, 12, 51, 234,...},...
|
|
PROGRAM
|
(PARI) {T(n, k)=local(X=x+x*O(x^n), Y=y+y*O(y^k)); k!*polcoeff(polcoeff(1/(1-X*besseli(0, 2*Y)-X*Y*besseli(1, 2*Y)), n, x), k, y)} (Hanna)
|
|
CROSSREFS
|
Rows include A000007, A001405, A005566, A064036. Columns include A000012, A001477, A002378, A064043. Cf. A064045.
Sequence in context: A107424 A155161 A065177 this_sequence A144912 A145337 A071464
Adjacent sequences: A064041 A064042 A064043 this_sequence A064045 A064046 A064047
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Henry Bottomley (se16(AT)btinternet.com), Aug 23 2001
|
|
|
Search completed in 0.002 seconds
|
