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.

A139741 a(n) = 11^n - 3^n.

This page as a plain text file.
%I A139741 #23 Mar 31 2025 17:56:10
%S A139741 0,8,112,1304,14560,160808,1770832,19484984,214352320,2357928008,
%T A139741 25937365552,285311493464,3138427845280,34522710549608,
%U A139741 379749828800272,4177248155066744,45949729820525440,505447028370153608,5559917313104810992,61159090447252284824,672749994929073224800
%N A139741 a(n) = 11^n - 3^n.
%H A139741 Vincenzo Librandi, <a href="/A139741/b139741.txt">Table of n, a(n) for n = 0..300</a>
%H A139741 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (14,-33).
%F A139741 a(n) = 14*a(n-1) - 33*a(n-2). - _Vincenzo Librandi_, Jun 02 2011
%F A139741 From _Bruno Berselli_, Oct 05 2014: (Start)
%F A139741 G.f.: 8*x/((1 - 3*x)*(1 - 11*x)).
%F A139741 a(n+1) = 8*A016146(n). (End)
%F A139741 E.g.f.: 2*exp(7*x)*sinh(4*x). - _Elmo R. Oliveira_, Mar 31 2025
%o A139741 (Magma) [11^n-3^n: n in [0..30]]; // _Vincenzo Librandi_, Jun 02 2011
%Y A139741 Cf. A016146, and similar sequences listed in A248225.
%K A139741 nonn,easy
%O A139741 0,2
%A A139741 _N. J. A. Sloane_, May 20 2008