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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A202207 a(n) = 3*a(n-1) - a(n-2) + a(n-3) with a(0)=1, a(1)=2, a(2)=5. 1

%I #10 Jun 13 2015 00:54:08

%S 1,2,5,14,39,108,299,828,2293,6350,17585,48698,134859,373464,1034231,

%T 2864088,7931497,21964634,60826493,168446342,466477167,1291811652,

%U 3577404131,9906877908,27435041245,75975649958,210398786537

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

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

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

%F a(n) = A200752(n+3)-A200752(n+2). - R. J. Mathar, Dec 15 2011

%K easy,nonn

%O 0,2

%A _Philippe Deléham_, Dec 14 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.

Last modified December 5 05:37 EST 2023. Contains 367575 sequences. (Running on oeis4.)