This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A180148 a(n) = 3*a(n-1)+a(n-2) with a(0)=2 and a(1)=5. 2
 2, 5, 17, 56, 185, 611, 2018, 6665, 22013, 72704, 240125, 793079, 2619362, 8651165, 28572857, 94369736, 311682065, 1029415931, 3399929858, 11229205505, 37087546373, 122491844624, 404563080245, 1336181085359, 4413106336322 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Inverse binomial transform of A052961 (without the leading 1). LINKS Index entries for linear recurrences with constant coefficients, signature (3,1). FORMULA G.f.: (2-x)/(1-3*x-x^2). a(n) = 3*a(n-1)+a(n-2) with a(0)=2 and a(1)=5. a(n) = ((4+7*A)*A^(-n-1)+(4+7*B)*B^(-n-1))/13 with A=(-3+sqrt(13))/2 and B=(-3-sqrt(13))/2. Limit(a(n+k)/a(k), k=infinity) = (-1)^n*2/(A006497(n)-A006190(n)*sqrt(13)). PROG (PARI) a(n)=([0, 1; 1, 3]^n*[2; 5])[1, 1] \\ Charles R Greathouse IV, Oct 13 2016 CROSSREFS Cf. A003688, A052906. Appears in A180142. Sequence in context: A121193 A159866 A042671 * A241133 A148410 A190531 Adjacent sequences:  A180145 A180146 A180147 * A180149 A180150 A180151 KEYWORD easy,nonn AUTHOR Johannes W. Meijer, Aug 13 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 December 9 19:51 EST 2019. Contains 329879 sequences. (Running on oeis4.)