|
%I #21 Jan 26 2020 21:49:15
%S 1,-2,1,2,-3,1,0,4,-4,1,-2,-1,7,-5,1,0,-4,-4,11,-6,1,4,2,-6,-10,16,-7,
%T 1,0,8,8,-6,-20,22,-8,1,-10,-5,11,19,-1,-35,29,-9,1,0,-20,-20,7,34,13,
%U -56,37,-10,1,28,14,-26,-46,-12,49,41,-84
%N Riordan array (sqrt(1+4x^2)-2x, (1+2x-sqrt(1+4x^2))/2).
%C Inverse of triangle A106195.
%C Row sums are A105523 (expansion of 1-xc(-x^2) where c(x) is the g.f. of A000108).
%C Product of A007318 and A124448 is inverse of A053538.
%C A124448*A007318 = A106180, as infinite lower triangular matrices. - _Philippe Deléham_, Oct 16 2007
%C Triangle T(n,k), read by rows, given by (-2,1,-1,1,-1,1,-1,1,-1,...) DELTA (1,0,0,0,0,0,0,0,...) where DELTA is the operator defined in A084938. - _Philippe Deléham_, Oct 09 2011
%e Triangle begins
%e 1;
%e -2, 1;
%e 2, -3, 1;
%e 0, 4, -4, 1;
%e -2, -1, 7, -5, 1;
%e 0, -4, -4, 11, -6, 1;
%e 4, 2, -6, -10, 16, -7, 1;
%e 0, 8, 8, -6, -20, 22, -8, 1;
%o (PARI)
%o N=12;
%o T(n, k)=sum(i=0, n-k, binomial(k, i)*binomial(n-k, i)*2^(n-k-i));
%o M=matrix(N, N);
%o for(n=1, N, for(k=1, n, M[n, k]=T(n-1, k-1))); /* A106195 */
%o A=M^-1; /* A124448 */
%o /* for (n=1, N, for(k=1, n, print1(M[n, k], ", "))); */ /* A106195 */
%o for (n=1, N, for(k=1, n, print1(A[n, k], ", "))); /* A124448 */
%o /* _Joerg Arndt_, May 14 2011 */
%Y Cf. A106195, A000045, A164948, A164942.
%K easy,sign,tabl
%O 0,2
%A _Paul Barry_, Nov 01 2006
%E Edited by _N. J. A. Sloane_, Dec 29 2011
|
