cp's OEIS Frontend

A106513 A Pell-Pascal matrix.

%I A106513 #28 Jan 18 2025 18:38:40
%S A106513 1,2,1,5,3,1,12,8,4,1,29,20,12,5,1,70,49,32,17,6,1,169,119,81,49,23,7,
%T A106513 1,408,288,200,130,72,30,8,1,985,696,488,330,202,102,38,9,1,2378,1681,
%U A106513 1184,818,532,304,140,47,10,1,5741,4059,2865,2002,1350,836,444,187,57,11,1
%N A106513 A Pell-Pascal matrix.
%C A106513 This triangle gives the iterated partial sums of the Pell sequence A000129(n+1), n>=0. - _Wolfdieter Lang_, Oct 05 2014
%H A106513 G. C. Greubel, <a href="/A106513/b106513.txt">Rows n = 0..50 of the triangle, flattened</a>
%F A106513 Riordan array (1/(1-2*x-x^2), x/(1-x)).
%F A106513 Number triangle T(n,0) = A000129(n+1), T(n,k) = T(n-1,k-1) + T(n-1,k).
%F A106513 T(n,k) = Sum_{j=0..floor((n+1)/2)} binomial(n+1, 2*j+k+1)*2^j.
%F A106513 Sum_{k=0..n} T(n, k) = A106514(n).
%F A106513 Sum_{k=0..floor(n/2)} T(n-k, k) = A106515(n).
%F A106513 T(n,k) = 3*T(n-1,k) + T(n-1,k-1) - T(n-2,k) - 2*T(n-2,k-1) - T(n-3,k) - T(n-3,k-1), T(0,0)=1, T(1,0)=2, T(1,1)=1, T(n,k)=0 if k<0 or if k>n. - _Philippe Deléham_, Jan 14 2014
%F A106513 From _Wolfdieter Lang_, Oct 05 2014: (Start)
%F A106513 O.g.f. for row polynomials R(n,x) = Sum_{k=0..n} T(n,k)*x^k: (1 - z)/((1 - 2*z - z^2)*(1 - (1+x)*z)).
%F A106513 O.g.f. column m: (1/(1 - 2*z - z^2))*(z/(1 - z))^m, m >= 0. (Riordan property).
%F A106513 The alternating row sums are shown in A001333.
%F A106513 A-sequence: [1, 1] (see the three term recurrence given above). Z-sequence has o.g.f. (2 + 3*x)/(1 + x), [2, 1, repeat(-1,1)] (unsigned A054977). See the W. Lang link under A006232 for Riordan A- and Z-sequences.
%F A106513 The inverse Riordan triangle is shown in A248156. (End)
%e A106513 The triangle T(n,k) begins:
%e A106513 n\k    0    1    2    3    4   5   6   7  8  9 10 ...
%e A106513 0:     1
%e A106513 1:     2    1
%e A106513 2:     5    3    1
%e A106513 3:    12    8    4    1
%e A106513 4:    29   20   12    5    1
%e A106513 5:    70   49   32   17    6   1
%e A106513 6:   169  119   81   49   23   7   1
%e A106513 7:   408  288  200  130   72  30   8   1
%e A106513 8:   985  696  488  330  202 102  38   9  1
%e A106513 9:  2378 1681 1184  818  532 304 140  47 10  1
%e A106513 10: 5741 4059 2865 2002 1350 836 444 187 57 11  1
%e A106513 ... Reformatted and extended. - _Wolfdieter Lang_, Oct 05 2014
%e A106513 -----------------------------------------------------
%e A106513 Recurrence from the Z-sequence (see the formula above) for T(0,n) in terms of the entries of row n-1. For example, 29 = T(4,0) = 2*12 + 1*8 + (-1)*4 + 1*1 = 29. - _Wolfdieter Lang_, Oct 05 2014
%t A106513 T[n_, k_]= Sum[Binomial[n+1, 2*j+k+1]*2^j, {j, 0, Floor[(n+1)/2]}];
%t A106513 Table[T[n, k], {n,0,12}, {k,0,n}]//Flatten (* _G. C. Greubel_, Aug 05 2021 *)
%o A106513 (Magma) [ (&+[Binomial(n+1, 2*j+k+1)*2^j: j in [0..Floor((n+1)/2)]]) : k in [0..n], n in [0..12]]; // _G. C. Greubel_, Aug 05 2021
%o A106513 (Sage)
%o A106513 @CachedFunction
%o A106513 def T(n, k):
%o A106513     if (k<0 or k>n): return 0
%o A106513     elif (k==0): return lucas_number1(n+1, 2, -1)
%o A106513     else: return T(n-1,k-1) + T(n-1,k)
%o A106513 flatten([[T(n, k) for k in (0..n)] for n in (0..12)]) # _G. C. Greubel_, Aug 05 2021
%Y A106513 Cf. A000129, A001333, A106514 (row sums), A106515 (antidiagonal sums), A248156.
%K A106513 easy,nonn,tabl
%O A106513 0,2
%A A106513 _Paul Barry_, May 05 2005