%I #9 Jul 10 2023 08:21:19
%S 0,1,2,12,36,156,544,2144,7872,30096,112416,425536,1598528,6031296,
%T 22699008,85552128,322177024,1213849856,4572111360,17224104960,
%U 64880993280,244410981376,920685043712,3468237545472,13064787542016
%N a(n) = A192384(n)/2.
%H G. C. Greubel, <a href="/A192385/b192385.txt">Table of n, a(n) for n = 1..1000</a>
%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (2,8,-4,-4).
%F From _G. C. Greubel_, Jul 10 2023: (Start)
%F T(n, k) = [x^k] ((x+sqrt(x+3))^n - (x-sqrt(x+3))^n)/(2*sqrt(x+3)).
%F a(n) = (1/2)*Sum_{k=0..n-1} T(n, k)*Fibonacci(k).
%F a(n) = 2*a(n-1) + 8*a(n-2) - 4*a(n-3) - 4*a(n-4).
%F G.f.: x^2/(1 - 2*x - 8*x^2 + 4*x^3 + 4*x^4). (End)
%t (See A192384.)
%t LinearRecurrence[{2,8,-4,-4}, {0,1,2,12}, 40] (* _G. C. Greubel_, Jul 10 2023 *)
%o (Magma)
%o R<x>:=PowerSeriesRing(Integers(), 41);
%o [0] cat Coefficients(R!( x^2/(1-2*x-8*x^2+4*x^3+4*x^4) )); // _G. C. Greubel_, Jul 10 2023
%o (SageMath)
%o @CachedFunction
%o def a(n): # a = A192385
%o if (n<5): return (0,0,1,2,12)[n]
%o else: return 2*a(n-1) +8*a(n-2) -4*a(n-3) -4*a(n-4)
%o [a(n) for n in range(1,41)] # _G. C. Greubel_, Jul 10 2023
%Y Cf. A192232, A192383, A192384.
%K nonn
%O 1,3
%A _Clark Kimberling_, Jun 30 2011