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 #17 Aug 11 2017 16:00:01
%S 0,4,18,76,320,1360,5832,25200,109568,478784,2100512,9244352,40784896,
%T 180284672,798121088,3537391360,15692333056,69661541376,309407486464,
%U 1374824795136,6110847909888,27168232722432,120809925167104
%N a(n)= 8*a(n-1) -16*a(n-2) +4*a(n-4).
%H <a href="/index/Rec">Index entries for linear recurrences with constant coefficients</a>, signature (8,-16,0,4)
%F G.f.: 2*x*(-2+7*x+2*x^2)/( (2*x^2+4*x-1) * (2*x^2-4*x+1)). [Sep 28 2009]
%F a(n) = A111567(n-1) + A090017(n+1) - A090017(n) - A090017(n-1), n>0.
%t M = {{0, 0, 0, 2}, {1, 4, 0, 0}, {0, 2, 0, 0}, {0, 0, 1, 4}} v[1] = {0, 1, 1, 2}; v[n_] := v[n] = M.v[n - 1]; digits = 50; a = Table[v[n][[1]], {n, 1, digits}]
%t LinearRecurrence[{8,-16,0,4},{0,4,18,76},30] (* _Harvey P. Dale_, Aug 11 2017 *)
%K nonn,easy
%O 0,2
%A _Roger L. Bagula_, May 30 2005
%E Definition replaced by recurrence by the Associate Editors of the OEIS, Sep 28 2009