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!)
A057819 a(0)=4, a(1)=9, a(n) = 4a(n-1) - a(n-2). 0

%I #25 Dec 25 2023 11:26:14

%S 4,9,32,119,444,1657,6184,23079,86132,321449,1199664,4477207,16709164,

%T 62359449,232728632,868555079,3241491684,12097411657,45148154944,

%U 168495208119,628832677532,2346835502009,8758509330504,32687201820007

%N a(0)=4, a(1)=9, a(n) = 4a(n-1) - a(n-2).

%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>

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

%F G.f.: (4-7x)/(1-4x+x^2). - _Philippe Deléham_, Nov 16 2008

%t Transpose[NestList[{Last[#],4Last[#]-First[#]}&,{4,9},40]][[1]] (* _Harvey P. Dale_, Mar 09 2011 *)

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_, Nov 09 2000

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