login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A163068 a(n) = 16*a(n-1) - 59*a(n-2) for n > 1; a(0) = 2, a(1) = 21. 2

%I #8 Sep 08 2022 08:45:46

%S 2,21,218,2249,23122,237261,2431978,24913249,255125282,2612122821,

%T 26741573498,273749929529,2802246036082,28684690735101,

%U 293622535632778,3005563816753489,30765291465721922,314916398263094901

%N a(n) = 16*a(n-1) - 59*a(n-2) for n > 1; a(0) = 2, a(1) = 21.

%C Binomial transform of A163067.

%H G. C. Greubel, <a href="/A163068/b163068.txt">Table of n, a(n) for n = 0..985</a>

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

%F a(n) = ((2+sqrt(5))*(8+sqrt(5))^n + (2-sqrt(5))*(8-sqrt(5))^n)/2.

%F G.f.: (2-11*x)/(1-16*x+59*x^2).

%t LinearRecurrence[{16, -59}, {2, 21}, 30] (* _G. C. Greubel_, Jan 08 2018 *)

%o (Magma) [ n le 2 select 19*n-17 else 16*Self(n-1)-59*Self(n-2): n in [1..18] ];

%o (PARI) x='x+O('x^30); Vec((2-11*x)/(1-16*x+59*x^2)) \\ _G. C. Greubel_, Jan 08 2018

%Y Cf. A163067.

%K nonn

%O 0,1

%A _Klaus Brockhaus_, Jul 20 2009

%E Definition corrected by _Vincenzo Librandi_, Dec 18 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 12:33 EDT 2024. Contains 371969 sequences. (Running on oeis4.)