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!)
A190870 a(n) = 11*a(n-1) - 22*a(n-2), a(0)=0, a(1)=1. 1

%I #18 Dec 21 2015 13:13:22

%S 0,1,11,99,847,7139,59895,501787,4201967,35182323,294562279,

%T 2466173963,20647543455,172867150819,1447292702999,12117142414971,

%U 101448127098703,849352264956371,7111016118348615,59535427472794603,498447347597071103,4173141419166300867

%N a(n) = 11*a(n-1) - 22*a(n-2), a(0)=0, a(1)=1.

%H G. C. Greubel, <a href="/A190870/b190870.txt">Table of n, a(n) for n = 0..1000</a>

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

%F a(n) = ((11+sqrt(33))^n-(11-sqrt(33))^n)/(2^n*sqrt(33)).

%F E.g.f.: (2/sqrt(33))*exp(11*x/2)*sinh(sqrt(33)*x/2). - _G. C. Greubel_, Dec 18 2015

%F G.f.: x/(1-11*x+22*x^2). - _G. C. Greubel_, Dec 18 2015

%t LinearRecurrence[{11, -22}, {0, 1}, 50] (* _T. D. Noe_, May 23 2011 *)

%o (PARI) concat(0, Vec(x/(1-11*x+22*x^2) + O(x^100))) \\ _Altug Alkan_, Dec 18 2015

%Y Cf. A190871, A190872, A190873

%K nonn

%O 0,3

%A _Rolf Pleisch_, May 22 2011

%E Extended by _T. D. Noe_, May 23 2011

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 06:14 EDT 2024. Contains 371964 sequences. (Running on oeis4.)