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.
%I A155665 #20 Aug 03 2024 17:00:19
%S A155665 1,18,184,1842,18736,193818,2033704,21584322,231136096,2492165418,
%T A155665 27011166424,293901605202,3207147853456,35072467957818,
%U A155665 384147880094344,4212432541504482,46231204840282816,507698828312979018,5577931712001713464,61303205636490402162,673902916437166856176
%N A155665 a(n) = 11^n + 8^n - 1.
%H A155665 Paolo Xausa, <a href="/A155665/b155665.txt">Table of n, a(n) for n = 0..950</a>
%H A155665 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (20,-107,88).
%F A155665 G.f.: 1/(1-11*x)+1/(1-8*x)-1/(1-x).
%F A155665 E.g.f.: exp(11*x)+exp(8*x)-exp(x).
%F A155665 a(n) = 19*a(n-1)-88*a(n-2)-70 with a(0) = 1, a(1) = 18. - _Vincenzo Librandi_, Jul 21 2010
%F A155665 a(0) = 1, a(1) = 18, a(2) = 184, a(n) = 20*a(n-1)-107*a(n-2)+88*a(n-3). - _Harvey P. Dale_, May 18 2011
%t A155665 Table[11^n+8^n-1,{n,0,20}] (* or *) LinearRecurrence[{20,-107,88},{1,18,184},20] (* _Harvey P. Dale_, May 18 2011 *)
%o A155665 (PARI) a(n)=11^n+8^n-1 \\ _Charles R Greathouse IV_, Jun 11 2015
%Y A155665 Cf. A155646, A155647, A155648, A155649, A155650, A155651, A155652, A155653, A155654, A155655, A155656, A155657, A155658, A155659, A155660, A155661, A155662, A155663, A155664.
%K A155665 nonn,easy
%O A155665 0,2
%A A155665 _Mohammad K. Azarian_, Jan 31 2009