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”).
%I #14 Jul 25 2015 10:42:33
%S 1,1,2,5,7,12,22,34,56,94,150,244,399,643,1042,1691,2733,4424,7164,
%T 11588,18752,30348,49100,79448,128557,208005,336562,544577,881139,
%U 1425716,2306866,3732582,6039448,9772042,15811490,25583532,41395035
%N Convolution of Fibonacci numbers and positive integers repeated three times (A000045 and A008620).
%H <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (1, 1, 2, -2, -2, -1, 1, 1).
%F a(n) = a(n-1)+2*a(n-2)-2*a(n-3)-2*a(n-4)-a(n-5)+a(n-6)+a(n-7).
%F G.f.: 1/((1 - x - x^2)*(1 - x^3)^2).
%t f[x_] := (1 - x^3)^2; g[x] := 1 - x - x^2;
%t s = Normal[Series[1/(f[x] g[x]), {x, 0, 60}]]
%t c = CoefficientList[s, x] (* A213044 *)
%Y Cf. A213500.
%K nonn,easy
%O 0,3
%A _Clark Kimberling_, Jun 10 2012