login
A026783
a(n) = T(2n, n-2), T given by A026780.
11
1, 11, 84, 557, 3446, 20514, 119336, 684227, 3886460, 21939528, 123347842, 691644044, 3871738018, 21652138770, 121026492186, 676391629701, 3780636102222, 21137831159462, 118234019051048, 661686074145618, 3705252204960252
OFFSET
2,2
LINKS
MAPLE
T:= proc(n, k) option remember;
if n<0 then 0;
elif k=0 or k =n then 1;
elif k <= n/2 then
procname(n-1, k-1)+procname(n-2, k-1)+procname(n-1, k) ;
else
procname(n-1, k-1)+procname(n-1, k) ;
fi ;
end proc:
seq(T(2*n, n-2), n=2..30); # G. C. Greubel, Nov 02 2019
MATHEMATICA
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] ]]];
Table[T[2*n, n-2], {n, 2, 30}] (* G. C. Greubel, Nov 02 2019 *)
PROG
(SageMath)
@CachedFunction
def T(n, k):
if (n<0): return 0
elif (k==0 or k==n): return 1
elif (k<=n/2): return T(n-1, k-1) + T(n-2, k-1) + T(n-1, k)
else: return T(n-1, k-1) + T(n-1, k)
[T(2*n, n-2) for n in (2..30)] # G. C. Greubel, Nov 02 2019
KEYWORD
nonn
STATUS
approved