|
%I #16 Jul 21 2021 10:02:19
%S 1,1,1,3,1,1,7,4,1,1,19,9,5,1,1,51,26,11,6,1,1,141,70,34,13,7,1,1,393,
%T 197,92,43,15,8,1,1,1107,553,265,117,53,17,9,1,1,3139,1570,751,346,
%U 145,64,19,10,1,1,8953,4476,2156,991,441,176,76,21,11,1,1
%N Triangle read by rows: product of A130595 and A092392 considered as infinite lower triangular arrays.
%C Riordan array (f(x), x*g(x)) where f(x) is the g.f. of A002426 and where g(x) is the g.f. of A005043. - _Philippe Deléham_, Dec 05 2009
%C Matrix product P * Q * P^(-1), where P denotes Pascal's triangle A007318 and Q denotes A061554 (formed from P by sorting the rows into descending order). Cf. A158815 and A171243. - _Peter Bala_, Jul 13 2021
%F T(n, m) = Sum_{k=m..n-1} A130595(n,k) * A092392(k+1,m+1), with the triangular interpretation of A092392.
%F Conjecture: T(n,1) = A113682(n-1). - _R. J. Mathar_, Oct 06 2009
%F Sum_{k=0..n} T(n,k)*x^k = A002426(n), A005773(n+1), A000244(n), A126932(n) for x = 0,1,2,3 respectively. - _Philippe Deléham_, Dec 03 2009
%F T(n, k) = (-1)^(k + n) binomial(n, k) hypergeom([k/2 + 1/2, k/2 + 1, k - n], [k + 1, k + 1], 4). - _Peter Luschny_, Jul 17 2021
%e First rows of the triangle:
%e 1;
%e 1, 1;
%e 3, 1, 1;
%e 7, 4, 1, 1;
%e 19, 9, 5, 1, 1;
%e 51, 26, 11, 6, 1, 1;
%e 141, 70, 34, 13, 7, 1, 1;
%e 393, 197, 92, 43, 15, 8, 1, 1;
%e 1107, 553, 265, 117, 53, 17, 9, 1, 1;
%e 3139, 1570, 751, 346, 145, 64, 19, 10, 1, 1;
%e 8953, 4476, 2156, 991, 441, 176, 76, 21, 11, 1, 1;
%p A158793 := proc (n, k)
%p add((-1)^(n+j)*binomial(n, j)*binomial(2*j-k, j-k), j = k..n);
%p end proc:
%p seq(seq(A158793(n, k), k = 0..n), n = 0..10); # _Peter Bala_, Jul 13 2021
%t T[n_, k_] := (-1)^(k + n) Binomial[n, k] HypergeometricPFQ[{k/2 + 1/2, k/2 + 1, k - n}, {k + 1, k + 1}, 4];
%t Table[T[n, k], {n, 0, 10}, {k, 0, n}] // Flatten (* _Peter Luschny_, Jul 17 2021 *)
%Y T(n, 0) = A002426(n), A005773 (row sums).
%Y Cf. A046899, A007318, A158815, A171243.
%K nonn,tabl
%O 0,4
%A _Gary W. Adamson_ & _Roger L. Bagula_, Mar 26 2009
%E Simplified definition from _R. J. Mathar_, Oct 06 2009
|
