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.

A055271 a(n) = 5*a(n-1) - a(n-2) with a(0)=1, a(1)=7.

This page as a plain text file.
%I A055271 #27 Jan 05 2025 19:51:36
%S A055271 1,7,34,163,781,3742,17929,85903,411586,1972027,9448549,45270718,
%T A055271 216905041,1039254487,4979367394,23857582483,114308545021,
%U A055271 547685142622,2624117168089,12572900697823,60240386321026,288629030907307,1382904768215509,6625894810170238,31746569282635681,152106951603008167
%N A055271 a(n) = 5*a(n-1) - a(n-2) with a(0)=1, a(1)=7.
%D A055271 A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pp. 122-125, 194-196.
%H A055271 G. C. Greubel, <a href="/A055271/b055271.txt">Table of n, a(n) for n = 0..1000</a>
%H A055271 I. Adler, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/7-2/adler.pdf">Three Diophantine equations - Part II</a>, Fib. Quart., 7 (1969), pp. 181-193.
%H A055271 E. I. Emerson, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/7-3/emerson.pdf">Recurrent Sequences in the Equation DQ^2=R^2+N</a>, Fib. Quart., 7 (1969), pp. 231-242.
%H A055271 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A055271 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (5,-1).
%F A055271 a(n) = (7*(((5+sqrt(21))/2)^n - ((5-sqrt(21))/2)^n) - (((5+sqrt(21))/2)^(n-1) - ((5-sqrt(21))/2)^(n-1)))/sqrt(21).
%F A055271 G.f.: (1+2*x)/(1-5*x+x^2).
%F A055271 a(n) = (-1)^n*Sum_{k = 0..n} A238731(n,k)*(-8)^k. - _Philippe Deléham_, Mar 05 2014
%F A055271 a(n) = ChebyshevT(n, 5/2) + (9/2)*ChebyshevU(n-1,5/2) = ChebyshevU(n, 5/2) + 2*ChebyshevU(n-1, 5/2). - _G. C. Greubel_, Mar 16 2020
%p A055271 A055271:= n-> simplify(ChebyshevU(n, 5/2) + 2*ChebyshevU(n-1, 5/2)); seq(A055271(n), n=0..30); # _G. C. Greubel_, Mar 16 2020
%t A055271 LinearRecurrence[{5,-1}, {1,7}, 30] (* _G. C. Greubel_, Mar 16 2020 *)
%o A055271 (Magma) I:=[1,7]; [n le 2 select I[n] else 5*Self(n-1) - Self(n-2): n in [1..30]]; // _G. C. Greubel_, Mar 16 2020
%o A055271 (Sage) [chebyshev_U(n, 5/2) + 2*chebyshev_U(n-1, 5/2) for n in (0..30)] # _G. C. Greubel_, Mar 16 2020
%Y A055271 Cf. A030221.
%K A055271 easy,nonn
%O A055271 0,2
%A A055271 _Barry E. Williams_, May 10 2000
%E A055271 Terms a(22) onward added by _G. C. Greubel_, Mar 16 2020