cp's OEIS Frontend

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.

A190971 a(n) = 5*a(n-1) - 10*a(n-2), with a(0)=0, a(1)=1.

This page as a plain text file.
%I A190971 #32 Jun 11 2022 06:32:36
%S A190971 0,1,5,15,25,-25,-375,-1625,-4375,-5625,15625,134375,515625,1234375,
%T A190971 1015625,-7265625,-46484375,-159765625,-333984375,-72265625,
%U A190971 2978515625,15615234375,48291015625,85302734375,-56396484375,-1135009765625,-5111083984375,-14205322265625
%N A190971 a(n) = 5*a(n-1) - 10*a(n-2), with a(0)=0, a(1)=1.
%H A190971 G. C. Greubel, <a href="/A190971/b190971.txt">Table of n, a(n) for n = 0..1000</a>
%H A190971 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (5,-10).
%F A190971 a(n) = (i/sqrt(15))*(((5 - i*sqrt(15))/2)^n - ((5 + i*sqrt(15))/2)^n). - _Giorgio Balzarotti_, May 28 2011
%F A190971 G.f.: x/(1 - 5*x + 10*x^2). - _Philippe Deléham_, Oct 12 2011
%F A190971 From _G. C. Greubel_, Jun 10 2022: (Start)
%F A190971 a(n) = 10^((n-1)/2) * ChebyshevU(n-1, sqrt(10)/4).
%F A190971 E.g.f.: (2/sqrt(15))*exp(5*x/2)*sin(sqrt(15)*x/2). (End)
%t A190971 LinearRecurrence[{5,-10}, {0,1}, 50]
%o A190971 (PARI) concat(0, Vec(x/(1-5*x+10*x^2) + O(x^100))) \\ _Altug Alkan_, Nov 26 2015
%o A190971 (Magma) [n le 2 select n-1 else 5*(Self(n-1) - 2*Self(n-2)): n in [1..51]]; // _G. C. Greubel_, Jun 10 2022
%o A190971 (Sage) [lucas_number1(n,5,10) for n in (0..50)] # _G. C. Greubel_, Jun 10 2022
%Y A190971 Cf. A190958 (index to generalized Fibonacci sequences).
%K A190971 sign
%O A190971 0,3
%A A190971 _Vladimir Joseph Stephan Orlovsky_, May 24 2011