|
%I #12 Nov 07 2019 21:11:32
%S 2,15,100,757,5902,46907,377520,3065809,25078650,206416795,1708129244,
%T 14202265321,118585167502,993915161547,8358970631568,70518298143329,
%U 596590060985546,5060232622624651,43022268222676124,366575545244139845,3129747701356459022,26771150349554898415
%N a(n) = Sum_{k=0..2n-2} T(n,k) * T(n,k+2), with T given by A027052.
%H G. C. Greubel, <a href="/A027080/b027080.txt">Table of n, a(n) for n = 2..1000</a>
%p T:= proc(n, k) option remember;
%p if k<0 or k>2*n then 0
%p elif k=0 or k=2 or k=2*n then 1
%p elif k=1 then 0
%p else add(T(n-1, k-j), j=1..3)
%p fi
%p end:
%p seq( add(T(n,k)*T(n,k+2), k=0..2*n-2), n=2..30); # _G. C. Greubel_, Nov 07 2019
%t T[n_, k_]:= T[n, k]= If[k<0 || k>2*n, 0, If[k==0 || k==2 || k==2*n, 1, If[k==1, 0, Sum[T[n-1, k-j], {j, 3}]]]]; Table[Sum[T[n, k]*T[n, k+2], {k, 0, 2*n-2}], {n,2,30}] (* _G. C. Greubel_, Nov 07 2019 *)
%o (Sage)
%o @CachedFunction
%o def T(n, k):
%o if (k<0 or k>2*n): return 0
%o elif (k==0 or k==2 or k==2*n): return 1
%o elif (k==1): return 0
%o else: return sum(T(n-1, k-j) for j in (1..3))
%o [sum(T(n,k)*T(n,k+2) for k in (0..2*n-2)) for n in (2..30)] # _G. C. Greubel_, Nov 07 2019
%K nonn
%O 2,1
%A _Clark Kimberling_
%E More terms from _Sean A. Irvine_, Oct 22 2019
|
