This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A168199 a(n) = 3*n - a(n-1) + 1 with n > 1, a(1)=2. 3

%I

%S 2,5,5,8,8,11,11,14,14,17,17,20,20,23,23,26,26,29,29,32,32,35,35,38,

%T 38,41,41,44,44,47,47,50,50,53,53,56,56,59,59,62,62,65,65,68,68,71,71,

%U 74,74,77,77,80,80,83,83,86,86,89,89,92,92,95,95,98,98,101,101,104,104,107

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

%H Vincenzo Librandi, <a href="/A168199/b168199.txt">Table of n, a(n) for n = 1..1000</a>

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

%F a(n) = (6*n + 5 + 3*(-1)^n)/4. - _Jon E. Schoenfield_, Jun 24 2010

%F G.f.: x*(2-x)*(1+2*x)/((1+x)*(1-x)^2). - _Bruno Berselli_, Feb 28 2012

%t LinearRecurrence[{1, 1, -1}, {2, 5, 5}, 70] (* _Vincenzo Librandi_, Feb 28 2012 *)

%o (MAGMA) I:=[2, 5, 5]; [n le 3 select I[n] else Self(n-1)+Self(n-2)-Self(n-3): n in [1..40]]; // _Vincenzo Librandi_, Feb 28 2012

%K nonn,easy

%O 1,1

%A _Vincenzo Librandi_, Nov 20 2009

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 21 00:17 EDT 2019. Contains 327252 sequences. (Running on oeis4.)