OFFSET
1,2
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (1,1,-1).
FORMULA
a(n) = (6*n + 5 + 11*(-1)^n)/4. - Jon E. Schoenfield, Jun 24 2010
a(n) = a(n-1) + a(n-2) - a(n-3). - Vincenzo Librandi, Feb 28 2012
G.f.: x^2*(7-4*x)/((1+x)*(1-x)^2). - Bruno Berselli, Feb 28 2012
Sum_{n>=2} (-1)^(n+1)/a(n) = 5/4 - Pi/(6*sqrt(3)) - log(3)/2. - Amiram Eldar, Feb 23 2023
MATHEMATICA
LinearRecurrence[{1, 1, -1}, {0, 7, 3}, 100] (* Vincenzo Librandi, Feb 28 2012 *)
PROG
(Magma) I:=[0, 7, 3]; [n le 3 select I[n] else Self(n-1)+Self(n-2)-Self(n-3): n in [1..70]]; // Vincenzo Librandi, Feb 28 2012
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Vincenzo Librandi, Nov 20 2009
EXTENSIONS
Partially edited by N. J. A. Sloane, Jun 25 2010
STATUS
approved