login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A026753
a(n) = T(n, floor(n/2)), T given by A026747.
10
1, 1, 3, 4, 11, 17, 44, 74, 184, 327, 790, 1461, 3452, 6584, 15278, 29879, 68290, 136391, 307696, 625731, 1395696, 2883357, 6367199, 13338421, 29193025, 61920497, 134442102, 288368511, 621609060, 1346873365, 2884432810
OFFSET
0,3
LINKS
MAPLE
A026747 := proc(n, k) option remember;
if k=0 or k = n then 1;
elif type(n, 'even') and 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) ;
end if ;
end proc:
seq(A026747(n, floor(n/2)), n=0..30); # G. C. Greubel, Oct 29 2019
MATHEMATICA
T[n_, k_]:= T[n, k]= If[k==0 || k==n, 1, If[EvenQ[n] && 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[n, Floor[n/2]], {n, 0, 30}] (* G. C. Greubel, Oct 29 2019 *)
PROG
(Sage)
@CachedFunction
def T(n, k):
if (k==0 or k==n): return 1
elif (mod(n, 2)==0 and 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(n, floor(n/2)) for n in (0..30)] # G. C. Greubel, Oct 29 2019
KEYWORD
nonn
STATUS
approved