login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A135432 a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4) - a(n-5) with a(0)=0, a(1)=1, a(2)=2, a(3)=3 and a(4)=4. 1

%I

%S 0,1,2,3,4,10,18,33,62,119,222,418,788,1485,2794,5263,9912,18666,

%T 35150,66197,124662,234763,442106,832578,1567912,2952697,5560530,

%U 10471611,19720172,37137098,69936714,131705065,248027438

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

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

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

%F G.f.: -x*(x-1)*(2*x^2+2*x+1)/((x+1)*(x^4-2*x^3+x^2-2*x+1)). - Maksym Voznyy, Aug 12 2009

%t LinearRecurrence[{1, 1, 1, 1, -1}, {0, 1, 2, 3, 4}, 50] (* _G. C. Greubel_, Oct 14 2016 *)

%K nonn

%O 0,3

%A _Mohamed Bouhamida_, Dec 13 2007

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 23 08:40 EDT 2021. Contains 348211 sequences. (Running on oeis4.)