cp's OEIS Frontend

A055839 T(2n+5,n), where T is the array in A055830.

%I A055839 #10 Jan 21 2020 10:08:46
%S A055839 8,58,344,1918,10415,55837,297374,1578160,8359845,44244825,234094080,
%T A055839 1238598580,6555004313,34703385031,183805639190,973982775784,
%U A055839 5163655102685,27389161216395,145349642782140,771718011707550
%N A055839 T(2n+5,n), where T is the array in A055830.
%H A055839 G. C. Greubel, <a href="/A055839/b055839.txt">Table of n, a(n) for n = 0..500</a>
%p A055839 with(combinat);
%p A055839 T:= proc(n, k) option remember;
%p A055839       if k<0 or k>n then 0
%p A055839     elif k=0 then fibonacci(n+1)
%p A055839     elif n=1 and k=1 then 0
%p A055839     else T(n-1, k-1) + T(n-1, k) + T(n-2, k)
%p A055839       fi; end:
%p A055839 seq(T(2*n+5, n), n=0..30); # _G. C. Greubel_, Jan 21 2020
%t A055839 T[n_, k_]:= T[n, k]= If[k<0 || k>n, 0, If[k==0, Fibonacci[n+1], If[n==1 && k==1, 0, T[n-1, k-1] + T[n-1, k] + T[n-2, k]]]]; Table[T[2*n+5, n], {n,0,30}] (* _G. C. Greubel_, Jan 21 2020 *)
%o A055839 (Sage)
%o A055839 @CachedFunction
%o A055839 def T(n, k):
%o A055839     if (k<0 and k>n): return 0
%o A055839     elif (k==0): return fibonacci(n+1)
%o A055839     elif (n==1 and k==1): return 0
%o A055839     else: return T(n-1, k-1) + T(n-1, k) + T(n-2, k)
%o A055839 [T(2*n+5, n) for n in (0..30)] # _G. C. Greubel_, Jan 21 2020
%Y A055839 Cf. A055830.
%K A055839 nonn
%O A055839 0,1
%A A055839 _Clark Kimberling_, May 28 2000