cp's OEIS Frontend

A155197 a(n) = 8*a(n-1) + a(n-2) for n>2, with a(0)=1, a(1)=7, a(2)=56.

%I A155197 #38 Dec 16 2023 16:59:40
%S A155197 1,7,56,455,3696,30023,243880,1981063,16092384,130720135,1061853464,
%T A155197 8625547847,70066236240,569155437767,4623309738376,37555633344775,
%U A155197 305068376496576,2478102645317383,20129889539035640,163517218957602503
%N A155197 a(n) = 8*a(n-1) + a(n-2) for n>2, with a(0)=1, a(1)=7, a(2)=56.
%H A155197 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (8,1).
%F A155197 G.f.: (1-x-x^2)/(1-8*x-x^2).
%F A155197 a(n) = Sum_{k=0..n} A155161(n,k)*7^k. - _Philippe Deléham_, Feb 08 2012
%p A155197 a:=proc(n) option remember; if n=0 then 1 elif n=1 then 7 elif n=2 then 56 else 8*a(n-1)+a(n-2); fi; end: seq(a(n), n=0..30); # _Wesley Ivan Hurt_, Jan 28 2017
%t A155197 LinearRecurrence[{8, 1}, {1, 7, 56}, 20] (* or *)
%t A155197 CoefficientList[Series[(1 - x - x^2)/(1 - 8 x - x^2), {x, 0, 19}], x] (* or *)
%t A155197 {1, 7}~Join~Table[Simplify[# (14/17) ((4 + #)^n - (4 - #)^n) + (7/2) ((4 + #)^n + (4 - #)^n) + Mod[Binomial[2 n, n], 2]] &@ Sqrt@ 17, {n, 18}] (* _Michael De Vlieger_, Jan 30 2017 *)
%Y A155197 Cf. A155161.
%K A155197 nonn,easy
%O A155197 0,2
%A A155197 _Philippe Deléham_, Jan 21 2009