cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A171498 a(n) = 4*3^n-1.

This page as a plain text file.
%I A171498 #24 Aug 04 2024 16:31:47
%S A171498 3,11,35,107,323,971,2915,8747,26243,78731,236195,708587,2125763,
%T A171498 6377291,19131875,57395627,172186883,516560651,1549681955,4649045867,
%U A171498 13947137603,41841412811,125524238435,376572715307,1129718145923,3389154437771,10167463313315,30502389939947
%N A171498 a(n) = 4*3^n-1.
%C A171498 Binomial transform of A171497.
%C A171498 Inverse binomial transform of A171499.
%H A171498 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (4,-3).
%F A171498 a(n) = 3*a(n-1)+2 for n > 0; a(0) = 3.
%F A171498 G.f.: (3-x)/((1-x)*(1-3*x)).
%F A171498 a(n) = A036543(n) + 2. - _Philippe Deléham_, Apr 13 2013
%F A171498 E.g.f.: exp(x)*(4*exp(2*x) - 1). - _Stefano Spezia_, Aug 04 2024
%t A171498 NestList[3#+2&,3,30]  (* _Harvey P. Dale_, Feb 25 2011 *)
%o A171498 (PARI) {m=25; v=concat([3], vector(m-1)); for(n=2, m, v[n]=3*v[n-1]+2); v}
%Y A171498 Cf. A010703, A036543, A171497, A171499.
%K A171498 nonn,easy
%O A171498 0,1
%A A171498 _Klaus Brockhaus_, Dec 10 2009
%E A171498 a(25)-a(27) from _Stefano Spezia_, Aug 04 2024