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!)
A133479 a(n) = a(n-1) + 8*a(n-2) for n >= 2, a(0)=1, a(1)=2. 2

%I #23 Jan 02 2024 08:55:07

%S 1,2,10,26,106,314,1162,3674,12970,42362,146122,485018,1653994,

%T 5534138,18766090,63039194,213167914,717481466,2422824778,8162676506,

%U 27545274730,92846686778,313208884618,1055982378842,3561653455786

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

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

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

%F a(n) = Sum_{k=0..n+1} A122950(n+1,k)*7^(n+1-k). - _Philippe Deléham_, Jan 08 2008

%F a(n) = ((11+sqrt(33))/22)*(1/2 + (1/2)*sqrt(33))^n + ((11-sqrt(33))/22)*(1/2 - (1/2)*sqrt(33))^n. - _Richard Choulet_, Nov 20 2008

%K easy,nonn

%O 0,2

%A _Philippe Deléham_, Jan 03 2008

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 23 08:33 EDT 2024. Contains 371905 sequences. (Running on oeis4.)