login
a(n) = 10*a(n-1) + 8*a(n-2), with a(0)=0, a(1)=1.
3

%I #20 Mar 15 2024 02:25:20

%S 0,1,10,108,1160,12464,133920,1438912,15460480,166116096,1784844800,

%T 19177376768,206052526080,2213944274944,23787862958080,

%U 255590183780352,2746204741468160,29506768884924416,317037326780989440,3406427418889289728,36600572803140812800

%N a(n) = 10*a(n-1) + 8*a(n-2), with a(0)=0, a(1)=1.

%H G. C. Greubel, <a href="/A190957/b190957.txt">Table of n, a(n) for n = 0..965</a>

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

%F G.f.: x/(1 - 10*x - 8*x^2). - _R. J. Mathar_, Jun 01 2011

%t LinearRecurrence[{10,8}, {0,1}, 50]

%t CoefficientList[Series[x/(1-10*x-8*x^2), {x, 0, 50}], x] (* _G. C. Greubel_, Jan 15 2018 *)

%o (PARI) x='x+O('x^30); concat([0], Vec(x/(1-10*x-8*x^2))) \\ _G. C. Greubel_, Jan 15 2018

%o (Magma) I:=[0,1]; [n le 2 select I[n] else 10*Self(n-1) + 8*Self(n-2): n in [1..30]]; // _G. C. Greubel_, Jan 15 2018

%K nonn,easy

%O 0,3

%A _Vladimir Joseph Stephan Orlovsky_, May 24 2011