|
%I #12 Nov 03 2019 15:49:58
%S 1,1,2,4,7,12,23,41,72,135,243,432,804,1455,2608,4836,8785,15838,
%T 29306,53385,96654,178600,326019,592140,1093135,1998537,3638700,
%U 6712659,12287071,22412784,41325279,75712253,138308808,254912873
%N a(n) = Sum_{k=0..floor(n/2)} T(n-k,k), T given by A026780.
%H G. C. Greubel, <a href="/A026790/b026790.txt">Table of n, a(n) for n = 0..1000</a>
%p T:= proc(n,k) option remember;
%p if n<0 then 0;
%p elif k=0 or k =n then 1;
%p elif k <= n/2 then
%p procname(n-1,k-1)+procname(n-2,k-1)+procname(n-1,k) ;
%p else
%p procname(n-1,k-1)+procname(n-1,k) ;
%p fi ;
%p end proc:
%p seq( add(T(n-k,k), k=0..floor(n/2)), n=0..40); # _G. C. Greubel_, Nov 02 2019
%t T[n_, k_]:= T[n, k]= If[n<0, 0, If[k==0 || k==n, 1, If[k<=n/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,k], {k, 0, Floor[n/2]}], {n,0,40}] (* _G. C. Greubel_, Nov 02 2019 *)
%o (Sage)
%o @CachedFunction
%o def T(n, k):
%o if (n<0): return 0
%o elif (k==0 or k==n): return 1
%o elif (k<=n/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, k) for k in (0..floor(n/2))) for n in (0..40)] # _G. C. Greubel_, Nov 02 2019
%Y Cf. A026780, A026781, A026782, A026783, A026784, A026785, A026786, A026787, A026788, A026789.
%K nonn
%O 0,3
%A _Clark Kimberling_
|
