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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A242762 a(n) = -a(n-1) + a(n-3) + 5*(n-2) for n>2, a(0)=2, a(1)=3, a(2)=4. 1
 2, 3, 4, 8, 10, 14, 19, 21, 28, 31, 35, 43, 43, 52, 56, 57, 70, 66, 76, 84, 77, 99, 90, 97, 117, 93, 129, 118, 110, 159, 104, 156, 158, 106, 215, 113, 168, 227, 71, 287, 135, 136, 356, -11, 362, 214, 0, 592, -143, 383, 454, -347, 985, -271, 189, 1066, -1062 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..1000 Robert Munafo, Eventually oscillating recurrence formulas, MCS52150530 Index entries for linear recurrences with constant coefficients, signature (1,1,0,-2,1). FORMULA G.f.: (2 + x - x^2 + x^3 + 2*x^4)/((1 - x)^2*(1 + x - x^3)). [Bruno Berselli, May 26 2014] MATHEMATICA CoefficientList[Series[(2 + x - x^2 + x^3 + 2 x^4)/((1 - x)^2 (1 + x - x^3)), {x, 0, 60}], x] LinearRecurrence[{1, 1, 0, -2, 1}, {2, 3, 4, 8, 10}, 80] (* Harvey P. Dale, Aug 27 2014 *) PROG (MAGMA) I:=[2, 3, 4]; [n le 3 select I[n] else -Self(n-1)+Self(n-3)+5*(n-2): n in [1..60]]; CROSSREFS Sequence in context: A033083 A302406 A328092 * A005542 A037171 A308811 Adjacent sequences:  A242759 A242760 A242761 * A242763 A242764 A242765 KEYWORD sign,easy AUTHOR Vincenzo Librandi, May 22 2014 STATUS approved

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.

Last modified February 25 22:55 EST 2020. Contains 332270 sequences. (Running on oeis4.)