login
a(n) = 8*a(n-1) -15*a(n-2), a(0)=1, a(1)=16.
1

%I #13 Sep 08 2022 08:45:09

%S 1,16,113,664,3617,18976,97553,495784,2502977,12587056,63151793,

%T 316408504,1583991137,7925801536,39646545233,198285338824,

%U 991584532097,4958396174416,24793401413873,123971268694744,619869128349857

%N a(n) = 8*a(n-1) -15*a(n-2), a(0)=1, a(1)=16.

%H Vincenzo Librandi, <a href="/A081194/b081194.txt">Table of n, a(n) for n = 0..200</a>

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (8,-15).

%F G.f.: (1+8*x)/((1-3*x)*(1-5*x)).

%F a(n) = 13*5^n/2 - 11*3^n/2.

%t CoefficientList[Series[(1 + 8 x) / ((1 - 3 x) (1 - 5 x)), {x, 0, 30}], x] (* _Vincenzo Librandi_, Aug 07 2013 *)

%t LinearRecurrence[{8,-15},{1,16},30] (* _Harvey P. Dale_, May 16 2019 *)

%o (Magma) [13*5^n/2 - 11*3^n/2: n in [0..25]]; // _Vincenzo Librandi_, Aug 07 2013

%K easy,nonn

%O 0,2

%A _Paul Barry_, Mar 11 2003