cp's OEIS Frontend

A126075 Triangle T(n,k), 0 <= k <= n, read by rows, defined by: T(0,0)=1, T(n,k)=0 if k < 0 or if k > n, T(n,0) = 2*T(n-1,0) + T(n-1,1), T(n,k) = T(n-1,k-1) + T(n-1,k+1) for k >= 1.

%I A126075 #24 Sep 17 2024 20:43:19
%S A126075 1,2,1,5,2,1,12,6,2,1,30,14,7,2,1,74,37,16,8,2,1,185,90,45,18,9,2,1,
%T A126075 460,230,108,54,20,10,2,1,1150,568,284,128,64,22,11,2,1,2868,1434,696,
%U A126075 348,150,75,24,12,2,1
%N A126075 Triangle T(n,k), 0 <= k <= n, read by rows, defined by: T(0,0)=1, T(n,k)=0 if k < 0 or if k > n, T(n,0) = 2*T(n-1,0) + T(n-1,1), T(n,k) = T(n-1,k-1) + T(n-1,k+1) for k >= 1.
%C A126075 Riordan array (c(x^2)/(1-2xc(x^2)),xc(x^2)) where c(x)=g.f. of Catalan numbers A000108. - _Philippe Deléham_, Mar 18 2007
%C A126075 This triangle belongs to the family of triangles defined by: T(0,0)=1, T(n,k)=0 if k<0 or if k>n, T(n,0)=x*T(n-1,0)+T(n-1,1), T(n,k)=T(n-1,k-1)+y*T(n-1,k)+T(n-1,k+1) for k>=1. Other triangles arise by choosing different values for (x,y): (0,0) -> A053121; (0,1) -> A089942; (0,2) -> A126093; (0,3) -> A126970; (1,0)-> A061554; (1,1) -> A064189; (1,2) -> A039599; (1,3) -> A110877; (1,4) -> A124576; (2,0) -> A126075; (2,1) -> A038622; (2,2) -> A039598; (2,3) -> A124733; (2,4) -> A124575; (3,0) -> A126953; (3,1) -> A126954; (3,2) -> A111418; (3,3) -> A091965; (3,4) -> A124574; (4,3) -> A126791; (4,4) -> A052179; (4,5) -> A126331; (5,5) -> A125906. - _Philippe Deléham_, Sep 25 2007
%H A126075 G. C. Greubel, <a href="/A126075/b126075.txt">Table of n, a(n) for the first 50 rows, flattened</a>
%H A126075 P. Bala, <a href="/A264772/a264772_1.pdf">A 4-parameter family of embedded Riordan arrays</a>
%F A126075 Sum_{k=0..n} T(n,k) = A127358(n). T(n,0)=A054341(n).
%F A126075 Sum_{k=0..n} T(n,k)*(-k+1) = 2^n. - _Philippe Deléham_, Mar 25 2007
%F A126075 From _Peter Bala_, Feb 20 2018: (Start)
%F A126075 T(n,k) = Sum_{j = 0..floor((n-k)/2)} 2^(n-k-2*j)*binomial(n, j) - Sum_{j = 0..floor((n-k-2)/2)} 2^(n-k-2-2*j)*binomial(n, j), 0 <= k <= n. - _Peter Bala_, Feb 20 2018
%F A126075 The n-th row polynomial in descending powers of x is the n-th Taylor polynomial of the rational function (1 - x^2)/(1 - 2*x) * (1 + x^2)^n about 0. For example, for n = 4, (1 - x^2)/(1 - 2*x) * (1 + x^2)^4 = (30*x^4 + 14*x*3 + 7*x^2 + 2*x + 1) + O(x^5). (End)
%e A126075 Triangle begins:
%e A126075      1;
%e A126075      2,    1;
%e A126075      5,    2,   1;
%e A126075     12,    6,   2,   1;
%e A126075     30,   14,   7,   2,   1;
%e A126075     74,   37,  16,   8,   2,  1;
%e A126075    185,   90,  45,  18,   9,  2,  1;
%e A126075    460,  230, 108,  54,  20, 10,  2,  1;
%e A126075   1150,  568, 284, 128,  64, 22, 11,  2, 1;
%e A126075   2868, 1434, 696, 348, 150, 75, 24, 12, 2, 1;
%p A126075 A126075 := proc (n, k)
%p A126075 add( 2^(n-k-2*j)*binomial(n, j), j = 0..floor((n-k)/2) ) - add( 2^(n-k-2-2*j)*binomial(n, j), j = 0..floor((n-k-2)/2) )
%p A126075 end proc:
%p A126075 # display sequence in triangular form
%p A126075 for n from 0 to 10 do seq(A126075(n, k), k = 0..n) end do;
%p A126075 # _Peter Bala_, Feb 20 2018
%t A126075 T[0, 0, x_, y_] := 1; T[n_, 0, x_, y_] := x*T[n - 1, 0, x, y] + T[n - 1, 1, x, y]; T[n_, k_, x_, y_] := T[n, k, x, y] = If[k < 0 || k > n, 0, T[n - 1, k - 1, x, y] + y*T[n - 1, k, x, y] + T[n - 1, k + 1, x, y]]; Table[T[n, k, 2, 0], {n, 0, 49}, {k, 0, n}] // Flatten  (* _G. C. Greubel_, Apr 21 2017 *)
%Y A126075 Cf. A000108, A054341, A127358.
%K A126075 nonn,tabl,easy
%O A126075 0,2
%A A126075 _Philippe Deléham_, Mar 02 2007