cp's OEIS Frontend

A290604 a(0) = 2, a(1) = 2; for n > 1, a(n) = a(n-1) + 2*a(n-2) + 3.

%I A290604 #72 Mar 06 2025 12:02:52
%S A290604 2,2,9,16,37,72,149,296,597,1192,2389,4776,9557,19112,38229,76456,
%T A290604 152917,305832,611669,1223336,2446677,4893352,9786709,19573416,
%U A290604 39146837,78293672,156587349,313174696,626349397,1252698792,2505397589,5010795176,10021590357
%N A290604 a(0) = 2, a(1) = 2; for n > 1, a(n) = a(n-1) + 2*a(n-2) + 3.
%C A290604 Ratio of successive terms approaches 2.
%H A290604 Iain Fox, <a href="/A290604/b290604.txt">Table of n, a(n) for n = 0..1000</a>
%H A290604 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (2,1,-2)
%F A290604 a(n) = (2^(n+2) + 2*(-1)^n)/3 + 2^n - (3-(-1)^n)/2.
%F A290604 a(n) = A014113(n+1) + A141023(n).
%F A290604 G.f.: (2 - 2*x + 3*x^2)/(1 - 2*x - x^2 + 2*x^3).
%F A290604 a(n) = 2*a(n-1) + a(n-2) - 2*a(n-3), n > 2. - _Iain Fox_, Dec 18 2017
%e A290604 a(0) = 2.
%e A290604 a(1) = 2.
%e A290604 a(2) = 2 + 2*2 + 3 = 9.
%e A290604 a(3) = 9 + 2*2 + 3 = 16.
%e A290604 a(4) = 16 + 9*2 + 3 = 37.
%e A290604 ...
%t A290604 Table[(2^(n + 2) + 2 (-1)^n) / 3 + 2^n - (3 - (-1)^n) / 2, {n, 0, 40}] (* _Vincenzo Librandi_, Oct 20 2017 *)
%t A290604 LinearRecurrence[{2,1,-2},{2,2,9},50] (* _Harvey P. Dale_, Mar 06 2025 *)
%o A290604 (PARI) Vec((2/(1-x-2*x^2)) + (3*x^2/((1-x)*(1-x-2*x^2))) + O(x^50)) \\ _Michel Marcus_, Oct 12 2017
%o A290604 (PARI) first(n) = Vec((2 - 2*x + 3*x^2)/(1 - 2*x - x^2 + 2*x^3) + O(x^n)) \\ _Iain Fox_, Dec 18 2017
%o A290604 (Magma) [(2^(n+2)+2*(-1)^n)/3+2^n-(3-(-1)^n)/2: n in [0..40]]; // _Vincenzo Librandi_, Oct 20 2017
%K A290604 easy,nonn
%O A290604 0,1
%A A290604 _Iain Fox_, Oct 11 2017