login
a(n) = A027052(n, 2n-10).
2

%I #11 Nov 07 2019 08:28:12

%S 1,1,3,11,37,125,423,1429,4811,16111,53589,176905,579407,1882943,

%T 6073469,19452705,61900375,195799527,615978629,1928297807,6009527345,

%U 18653079889,57686469763,177812890843,546456642501,1674844848629

%N a(n) = A027052(n, 2n-10).

%H G. C. Greubel, <a href="/A027066/b027066.txt">Table of n, a(n) for n = 5..750</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( T(n,2*n-10), n=5..30); # _G. C. Greubel_, Nov 06 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[T[n,2*n-10], {n,5,30}] (* _G. C. Greubel_, Nov 06 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 [T(n,2*n-10) for n in (5..30)] # _G. C. Greubel_, Nov 06 2019

%K nonn

%O 5,3

%A _Clark Kimberling_