OFFSET
1,2
LINKS
Lili Mu, Yuanyuan Xing, and Sai-Nan Zheng, A New Criterion for the Total Positivity of Riordan Arrays, Journal of Integer Sequences, Vol. 28 (2025), Article 25.7.5. See p. 8.
FORMULA
T(n,m) = (m*Sum_{k=0..n-m} (-1)^(n-m-k)*binomial(n+k-1,n-1)*Sum_{j=0..k} binomial(j,n-m+(-3)*k+2*j)*binomial(k,j)*2^(2*n-2*m+(-5)*k+3*j)*3^(-n+m+3*k-j))/n.
T(n,m) = (m*Sum_{k=m..n} binomial(-m+2*k-1,k-1)*2^(n-k)*binomial(2*n-k-1,n-1))/n. - Vladimir Kruchinin, Dec 21 2011
T(n,m) = (m/n)*2^(n-m)*binomial(2*n-m-1,n-m)*hypergeometric([1/2+m/2,m/2,m-n],[m,1+m-2*n],2) for n>1, m>1. - Peter Luschny, Jan 04 2012
EXAMPLE
1,
3, 1,
14, 6, 1,
77, 37, 9, 1,
462, 238, 69, 12, 1,
2926, 1582, 510, 110, 15, 1
PROG
(Maxima)
T(n, m):=(m*sum((-1)^(n-m-k)*binomial(n+k-1, n-1)*sum(binomial(j, n-m+(-3)*k+2*j)*binomial(k, j)*2^(2*n-2*m+(-5)*k+3*j)*3^(-n+m+3*k-j), j, 0, k), k, 0, n-m))/n;
T(n, m):=(m*sum(binomial(-m+2*k-1, k-1)*2^(n-k)*binomial(2*n-k-1, n-1), k, m, n))/n;
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Vladimir Kruchinin, Dec 10 2011
STATUS
approved
