%I #8 Nov 24 2021 03:06:44
%S 1,-1,1,-4,0,1,0,0,-1,1,0,-4,0,0,1,0,0,0,0,-1,1,0,0,-4,0,0,0,1,0,0,0,
%T 0,0,0,-1,1,0,0,0,-4,0,0,0,0,1,0,0,0,0,0,0,0,0,-1,1,0,0,0,0,-4,0,0,0,
%U 0,0,1,0,0,0,0,0,0,0,0,0,0,-1,1,0,0,0,0,0,-4,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,-1,1,0,0,0,0,0,0,-4,0,0,0,0,0,0,0,1
%N A divide-and-conquer related triangle.
%H G. C. Greubel, <a href="/A115713/b115713.txt">Rows n = 0..50 of the triangle, flattened</a>
%F G.f.: (1-x+x*y)/(1-x^2*y^2) - 4*x^2/(1-x^2*y).
%F (1, x) - (x, x)/2 - (x, -x)/2 - 4*(x^2, x^2) expressed in the notation of stretched Riordan arrays.
%F Column k has g.f.: x^k - (x*(-x)^k + x^(k+1))/2 - 4*x^(2*k+2).
%F T(n, k) = if(n=k, 1, 0) OR if(n=2k+2, -4, 0) OR if(n=k+1, -(1+(-1)^k)/2, 0).
%F Sum_{k=0..n} T(n, k) = A115634(n).
%F Sum_{k=0..floor(n/2)} T(n-k, k) = A115714(n).
%e Triangle begins
%e 1;
%e -1, 1;
%e -4, 0, 1;
%e 0, 0, -1, 1;
%e 0, -4, 0, 0, 1;
%e 0, 0, 0, 0, -1, 1;
%e 0, 0, -4, 0, 0, 0, 1;
%e 0, 0, 0, 0, 0, 0, -1, 1;
%e 0, 0, 0, -4, 0, 0, 0, 0, 1;
%e 0, 0, 0, 0, 0, 0, 0, 0, -1, 1;
%e 0, 0, 0, 0, -4, 0, 0, 0, 0, 0, 1;
%e 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1;
%e 0, 0, 0, 0, 0, -4, 0, 0, 0, 0, 0, 0, 1;
%e 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1;
%e 0, 0, 0, 0, 0, 0, -4, 0, 0, 0, 0, 0, 0, 0, 1;
%p A115713 := proc(n,k)
%p coeftayl( (1-x+x*y)/(1-x^2*y^2)-4*x^2/(1-x^2*y),x=0,n) ;
%p coeftayl( %,y=0,k) ;
%p end proc: # _R. J. Mathar_, Sep 07 2016
%t T[n_, k_]:= If[k==n, 1, If[k==n-1, -(1-(-1)^n)/2, If[n==2*k+2, -4, 0]]];
%t Table[T[n, k], {n,0,18}, {k,0,n}]//Flatten (* _G. C. Greubel_, Nov 23 2021 *)
%o (Sage)
%o def A115713(n,k):
%o if (k==n): return 1
%o elif (k==n-1): return -(n%2)
%o elif (n==2*k+2): return -4
%o else: return 0
%o flatten([[A115713(n,k) for k in (0..n)] for n in (0..18)]) # _G. C. Greubel_, Nov 23 2021
%Y Cf. A115634 (row sums), A115714 (diagonal sums), A115715 (inverse).
%K easy,sign,tabl
%O 0,4
%A _Paul Barry_, Jan 29 2006
|