|
|
|
|
|
|
|
|
|
#57 by Michael De Vlieger at Tue Apr 26 11:57:05 EDT 2022
|
|
|
|
|
|
|
|
#56 by Joerg Arndt at Tue Apr 26 10:53:49 EDT 2022
|
|
|
|
|
|
|
|
#55 by Wesley Ivan Hurt at Tue Apr 26 10:50:10 EDT 2022
|
|
|
|
|
|
|
|
#54 by Wesley Ivan Hurt at Tue Apr 26 10:49:51 EDT 2022
|
|
| FORMULA
|
The array can be extended to negative values of n: T(-n,k) = ) = 2*binomial(-n+1, k+2)*binomial(-n-2, k)/(-n+1) = -A145596(n+k,k+1) for n >= 2. - Peter Bala, Apr 26 2022
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
|
#53 by Michel Marcus at Tue Apr 26 10:43:40 EDT 2022
|
|
|
|
|
|
|
|
#52 by Michel Marcus at Tue Apr 26 10:43:37 EDT 2022
|
|
| LINKS
|
E. Emeric Deutsch, <a href="http://dx.doi.org/10.1016/S0012-365X(98)00371-9">Dyck path enumeration</a>, Discrete Math., 204, 1999, 167-202.
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
|
#51 by Peter Bala at Tue Apr 26 08:36:23 EDT 2022
|
|
|
|
|
|
|
|
#50 by Peter Bala at Tue Apr 26 08:36:19 EDT 2022
|
|
| FORMULA
|
The array can be extended to negative values of n: T(-n,k) = 2*binomial(-n+1, k+2)*binomial(-n-2, k)/(-n+1) = -A145596(n+k,k+1) for n >= 2. - Peter Bala, Apr 26 2022
|
|
|
|
|
|
|
#49 by Peter Bala at Tue Apr 26 05:40:08 EDT 2022
|
|
| FORMULA
|
The array can be extended to negative values of n: T(-n,k) = -A145596(n+k,k+1) for n >= 2. - Peter Bala, Apr 26 2022
|
|
| CROSSREFS
|
Cf. A145596.
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#48 by Alois P. Heinz at Tue Feb 09 21:01:08 EST 2021
|
|
|
|
|
|
|
