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 A190957 #20 Mar 15 2024 02:25:20
%S A190957 0,1,10,108,1160,12464,133920,1438912,15460480,166116096,1784844800,
%T A190957 19177376768,206052526080,2213944274944,23787862958080,
%U A190957 255590183780352,2746204741468160,29506768884924416,317037326780989440,3406427418889289728,36600572803140812800
%N A190957 a(n) = 10*a(n-1) + 8*a(n-2), with a(0)=0, a(1)=1.
%H A190957 G. C. Greubel, <a href="/A190957/b190957.txt">Table of n, a(n) for n = 0..965</a>
%H A190957 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (10,8).
%F A190957 G.f.: x/(1 - 10*x - 8*x^2). - _R. J. Mathar_, Jun 01 2011
%t A190957 LinearRecurrence[{10,8}, {0,1}, 50]
%t A190957 CoefficientList[Series[x/(1-10*x-8*x^2), {x, 0, 50}], x] (* _G. C. Greubel_, Jan 15 2018 *)
%o A190957 (PARI) x='x+O('x^30); concat([0], Vec(x/(1-10*x-8*x^2))) \\ _G. C. Greubel_, Jan 15 2018
%o A190957 (Magma) I:=[0,1]; [n le 2 select I[n] else 10*Self(n-1) + 8*Self(n-2): n in [1..30]]; // _G. C. Greubel_, Jan 15 2018
%K A190957 nonn,easy
%O A190957 0,3
%A A190957 _Vladimir Joseph Stephan Orlovsky_, May 24 2011