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 A155622 #16 Sep 05 2018 08:20:09
%S A155622 1,10,118,1324,14626,161020,1771498,19487044,214358626,2357947180,
%T A155622 25937423578,285311668564,3138428372626,34522712135740,
%U A155622 379749833566858,4177248169382884,45949729863506626,505447028499162700
%N A155622 a(n) = 11^n - 2^n + 1.
%C A155622 In general: r^n - s^n + 1 = (r+s)*a(n-1)-(r*s)*a(n-2)+(r-1)*(s-1). - _Vincenzo Librandi_, Jul 21 2010
%H A155622 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (14,-35,22).
%F A155622 G.f.: 1/(1 - 11*x) - 1/(1 - 2*x) + 1/(1-x).
%F A155622 E.g.f.: exp(11*x) - exp(2*x) + exp(x).
%F A155622 a(n) = 13*a(n-1) - 22*a(n-2) + 10 for n>1, a(0)=1, a(1)=10. - _Vincenzo Librandi_, Jul 21 2010
%t A155622 Table[11^n - 2^n + 1, {n, 0, 20}] (* or *) LinearRecurrence[{14, -35, 22}, {1, 10, 118}, 20] (* _Harvey P. Dale_, Oct 21 2013 *)
%o A155622 (PARI) a(n)=11^n-2^n+1 \\ _Charles R Greathouse IV_, Jun 11 2015
%Y A155622 Cf. A155588, A155589, A155590, A155592, A155593, A155594, A155595, A155596, A155597, A155598, A155599, A155600, A155601.
%K A155622 nonn,easy
%O A155622 0,2
%A A155622 _Mohammad K. Azarian_, Jan 29 2009