|
Search: id:A156534
|
|
|
| A156534 |
|
A triangular recursion sequence: A(n,k,m)= (m* n - m*k + 1)*A(n - 1, k - 1, m) + (m*k - (m - 1))*A(n - 1, k, m); t(n,k)=2*A(n, k, 1)*A(n + 1, k + 1, 0)/(n - k + 1) - A(n, k, 0)*A(n, k, 1). |
|
+0
1
|
|
| 1, 1, 1, 1, 4, 1, 1, 11, 11, 1, 1, 26, 44, 26, 1, 1, 57, 0, 0, 57, 1, 1, 120, -1191, -6040, -1191, 120, 1, 1, 247, -10017, -109333, -109333, -10017, 247, 1, 1, 502, -58432, -1235276, -3061324, -1235276, -58432, 502, 1, 1, 1013, -287040, -10924608
(list; table; graph; listen)
|
|
|
Search completed in 0.002 seconds
|
