|
%I #9 Jul 20 2019 08:09:51
%S 1,2,6,20,78,282,1187,4428,19175,72820,319493,1227712,5424359,
%T 21018514,93252862,363563668,1617342486,6334904252,28232695584,
%U 110982722888,495257577162
%N Self-convolution of row n of array T given by A026736.
%H G. C. Greubel, <a href="/A027215/b027215.txt">Table of n, a(n) for n = 0..1000</a>
%t T[n_, k_]:= T[n, k] = If[k==0 || k==n, 1, If[EvenQ[n] && k==(n-2)/2, T[n-1, k-1] + T[n-2, k-1] + T[n-1, k], T[n-1, k-1] + T[n-1, k]]];
%t Table[Sum[T[n, k]*T[n, n-k], {k,0,n}], {n,0,40}] (* _G. C. Greubel_, Jul 19 2019 *)
%o (PARI) T(n, k) = if(k==n || k==0, 1, k==n-1, n, if((n%2)==0 && k==(n-2)/2, T(n-1, k-1) + T(n-2, k-1) + T(n-1, k), T(n-1, k-1) + T(n-1, k) ));
%o vector(21, n, n--; sum(k=0, n, T(n, k)*T(n,n-k)) ) \\ _G. C. Greubel_, Jul 19 2019
%o (Sage)
%o @CachedFunction
%o def T(n, k):
%o if (k==0 or k==n): return 1
%o if (k==n-1): return n
%o elif (mod(n, 2)==0 and k==(n-2)/2): return T(n-1, k-1) + T(n-2, k-1) + T(n-1, k)
%o else: return T(n-1, k-1) + T(n-1, k)
%o [sum(T(n,k)*T(n,n-k) for k in (0..n)) for n in (0..40)] # _G. C. Greubel_, Jul 19 2019
%o (GAP)
%o T:= function(n, k)
%o if k=0 or k=n then return 1;
%o elif k=n-1 then return n;
%o elif (n mod 2)=0 and k=Int((n-2)/2) then return T(n-1, k-1) + T(n-2, k-1) + T(n-1, k);
%o else return T(n-1, k-1) + T(n-1, k);
%o fi;
%o end;
%o List([0..20], n-> Sum([0..n], k-> T(n, k)*T(n,n-k) )); # _G. C. Greubel_, Jul 19 2019
%Y Cf. A026736.
%K nonn
%O 0,2
%A _Clark Kimberling_
|
