login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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
CROSSREFS
Sequence in context: A143680 A058569 A231882 * A027222 A026380 A030225
KEYWORD
nonn
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 15:11 EDT 2024. Contains 371794 sequences. (Running on oeis4.)