This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A168197 a(n) = 3*n - a(n-1) + 1 with n > 1, a(1)=0. 1
 0, 7, 3, 10, 6, 13, 9, 16, 12, 19, 15, 22, 18, 25, 21, 28, 24, 31, 27, 34, 30, 37, 33, 40, 36, 43, 39, 46, 42, 49, 45, 52, 48, 55, 51, 58, 54, 61, 57, 64, 60, 67, 63, 70, 66, 73, 69, 76, 72, 79, 75, 82, 78, 85, 81, 88, 84, 91, 87, 94, 90, 97, 93, 100, 96, 103, 99, 106, 102 (list; graph; refs; listen; history; text; internal format)
 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 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 Sequence in context: A134883 A201329 A084000 * A257324 A138859 A257328 Adjacent sequences:  A168194 A168195 A168196 * A168198 A168199 A168200 KEYWORD nonn,easy AUTHOR Vincenzo Librandi, Nov 20 2009 EXTENSIONS Partially edited by N. J. A. Sloane, Jun 25 2010 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 September 20 07:59 EDT 2019. Contains 327214 sequences. (Running on oeis4.)