|
%I #25 Jun 20 2021 03:09:00
%S 1,1,1,1,1,1,2,2,1,1,2,3,3,1,1,5,5,4,4,1,1,5,9,9,5,5,1,1,14,14,14,14,
%T 6,6,1,1,14,28,28,20,20,7,7,1,1,42,42,48,48,27,27,8,8,1,1,42,90,90,75,
%U 75,35,35,9,9,1,1
%N Riordan array (c(x^2)*(1+xc(x^2)), xc(x^2)).
%C Inverse of A165620. Row sums are A001405(n+1). Diagonal sums are A026008.
%C Factors as (1+xc(x^2),x)*(c(x^2),xc(x^2)). Transforms (-2)^n to a sequence with Hankel transform F(2n+1).
%C In general, the Hankel transform of r^n by this matrix will have a Hankel transform with g.f. (1-x)/(1+(r-1)x+x^2).
%H Paul Barry, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL12/Barry4/barry64.html">Symmetric Third-Order Recurring Sequences, Chebyshev Polynomials, and Riordan Arrays</a>, JIS 12 (2009) 09.8.6.
%F Number triangle T(n,k)=sum{j=0..n, b(n-j)*sum{i=0..k, (-1)^(k-i)*C(k,i)*sum{m=0..i, C(i,m)*(C(i-m,m+k)-C(i-m,i+k+2))}}} where b(n) is the sequence beginning with 1 followed by the aerated Catalan numbers: 1,1,0,1,0,2,0,5,0,14,...
%e Triangle begins
%e 1,
%e 1, 1,
%e 1, 1, 1,
%e 2, 2, 1, 1,
%e 2, 3, 3, 1, 1,
%e 5, 5, 4, 4, 1, 1,
%e 5, 9, 9, 5, 5, 1, 1,
%e 14, 14, 14, 14, 6, 6, 1, 1,
%e 14, 28, 28, 20, 20, 7, 7, 1, 1,
%e 42, 42, 48, 48, 27, 27, 8, 8, 1, 1
%e The production array of this matrix begins
%e 1, 1,
%e 0, 0, 1,
%e 1, 1, 0, 1,
%e -1, 0, 1, 0, 1,
%e 1, 0, 0, 1, 0, 1,
%e -1, 0, 0, 0, 1, 0, 1,
%e 1, 0, 0, 0, 0, 1, 0, 1,
%e -1, 0, 0, 0, 0, 0, 1, 0, 1,
%e 1, 0, 0, 0, 0, 0, 0, 1, 0, 1
%t (* The function RiordanArray is defined in A256893. *)
%t nmax = 10;
%t M = PadRight[#, nmax+1]& /@ RiordanArray[(1-#)/(1-#^4)&, #/(1+#^2)&, nmax+1];
%t T = Inverse[M];
%t Table[T[[n+1, k+1]], {n, 0, nmax}, {k, 0, n}] // Flatten (* _Jean-François Alcover_, Jul 16 2019 *)
%o (Sage) # Algorithm of L. Seidel (1877)
%o # Prints the first n rows of the signed version of the triangle.
%o def Signed_A165621_triangle(n) :
%o D = [0]*(n+4); D[1] = 1
%o b = False; h = 3
%o for i in range(2*n) :
%o if b :
%o for k in range(h,0,-1) : D[k] += D[k-1]
%o h += 1
%o else :
%o for k in range(1,h, 1) : D[k] -= D[k+1]
%o if b : print([D[z] for z in (2..h-2)])
%o b = not b
%o Signed_A165621_triangle(11) # _Peter Luschny_, May 01 2012
%K easy,nonn,tabl
%O 0,7
%A _Paul Barry_, Sep 22 2009
|
