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 A165470 #20 Sep 08 2022 08:45:47 %S A165470 1,5,15,85,215,1485,2815,26885,29415,508285,80015,10085685,-8485385, %T A165470 210199085,-379906785,4583888485,-12182024185,103859793885, %U A165470 -347500277585,2424696155285,-9374701706985,57868624812685,-245362658952385,1402735155206085,-6309988334253785 %N A165470 a(0)=1, a(1)=5, a(n) = 20*a(n-2) - a(n-1). %C A165470 a(n)/a(n-1) tends to -5. %H A165470 G. C. Greubel, <a href="/A165470/b165470.txt">Table of n, a(n) for n = 0..1000</a> %H A165470 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (-1,20). %F A165470 G.f.: (1+6*x)/(1+x-20*x^2). %F A165470 a(n) = Sum_{k=0..n} A112555(n,k)*4^k. %F A165470 a(n) = (10*4^n-(-5)^n)/9. - _Klaus Brockhaus_, Sep 25 2009 %F A165470 E.g.f.: (10*exp(4*x) - exp(-5*x))/9. - _G. C. Greubel_, Oct 20 2018 %p A165470 seq(coeff(series((1+6*x)/(1+x-20*x^2),x,n+1), x, n), n = 0 .. 25); # _Muniru A Asiru_, Oct 21 2018 %t A165470 LinearRecurrence[{-1,20}, {1,5}, 40] (* _G. C. Greubel_, Oct 20 2018 *) %o A165470 (PARI) vector(40, n, n--; (10*4^n-(-5)^n)/9) \\ _G. C. Greubel_, Oct 20 2018 %o A165470 (Magma) [(10*4^n-(-5)^n)/9: n in [0..40]]; // _G. C. Greubel_, Oct 20 2018 %o A165470 (Python) for n in range(0, 30): print(int((10*4**n-(-5)**n)/9), end=', ') # _Stefano Spezia_, Oct 21 2018 %o A165470 (GAP) a:=[1,5];; for n in [3..25] do a[n]:=20*a[n-2]-a[n-1]; od; a; # _Muniru A Asiru_, Oct 21 2018 %K A165470 easy,sign %O A165470 0,2 %A A165470 _Philippe Deléham_, Sep 20 2009