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 A074546 #18 Sep 08 2022 08:45:07
%S A074546 3,19,149,1249,10673,91849,793649,6880249,59824193,521638729,
%T A074546 4560527249,39970996249,351149017313,3091621650409,27274838982449,
%U A074546 241075504216249,2134495165628033,18928981513482889,168109033806743249
%N A074546 a(n) = 2^n + 8^n + 9^n.
%H A074546 Vincenzo Librandi, <a href="/A074546/b074546.txt">Table of n, a(n) for n = 0..200</a>
%H A074546 <a href="/index/Rec">Index entries for linear recurrences with constant coefficients</a>, signature (19,-106,144).
%F A074546 From _Mohammad K. Azarian_, Dec 28 2008: (Start)
%F A074546 G.f.: 1/(1-2*x) + 1/(1-8*x) + 1/(1-9*x).
%F A074546 E.g.f.: exp(2*x) + exp(8*x) + exp(9*x). (End)
%F A074546 a(n) = 19*a(n-1) - 106*a(n-2) + 144*a(n-3).
%t A074546 Table[2^n + 8^n + 9^n, {n, 0, 20}]
%t A074546 LinearRecurrence[{19,-106,144},{3,19,149},20] (* _Harvey P. Dale_, May 31 2013 *)
%o A074546 (Magma) [ 2^n + 8^n + 9^n: n in [0..30]]; // _Vincenzo Librandi_, Jun 13 2011
%Y A074546 Cf. A001550, A001576, A034513, A001579, A074501 - A074580.
%K A074546 easy,nonn
%O A074546 0,1
%A A074546 _Robert G. Wilson v_, Aug 23 2002