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 A054488 #47 Jul 02 2025 16:01:59
%S A054488 1,8,47,274,1597,9308,54251,316198,1842937,10741424,62605607,
%T A054488 364892218,2126747701,12395593988,72246816227,421085303374,
%U A054488 2454265004017,14304504720728,83372763320351,485932075201378,2832219687887917
%N A054488 Expansion of (1+2*x)/(1-6*x+x^2).
%C A054488 Bisection (even part) of Chebyshev sequence with Diophantine property.
%C A054488 b(n)^2 - 8*a(n)^2 = 17, with the companion sequence b(n)= A077240(n).
%C A054488 The odd part is A077413(n) with Diophantine companion A077239(n).
%D A054488 A. H. Beiler, Recreations in the Theory of Numbers, Dover, N. Y., 1964, pp. 122-125, 194-196.
%H A054488 G. C. Greubel, <a href="/A054488/b054488.txt">Table of n, a(n) for n = 0..1000</a>
%H A054488 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 A054488 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 A054488 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A054488 <a href="/index/Ch#Cheby">Index entries for sequences related to Chebyshev polynomials.</a>
%H A054488 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (6,-1).
%F A054488 a(n) = 6*a(n-1) - a(n-2), a(0)=1, a(1)=8.
%F A054488 a(n) = ((3 + 2*sqrt(2))^(n+1) - (3 - 2*sqrt(2))^(n+1) + 2*((3 + 2*sqrt(2))^n - (3 - 2*sqrt(2))^n))/(4*sqrt(2)).
%F A054488 a(n) = S(n, 6) + 2*S(n-1, 6), with S(n, x) Chebyshev's polynomials of the second kind, A049310. S(n, 6) = A001109(n+1).
%F A054488 a(n) = (-1)^n*Sum_{k = 0..n} A238731(n,k)*(-9)^k. - _Philippe Deléham_, Mar 05 2014
%F A054488 a(n) = (Pell(2*n+2) + 2*Pell(2*n))/2 = (Pell-Lucas(2*n+1) + Pell(2*n))/2. - _G. C. Greubel_, Jan 19 2020
%F A054488 E.g.f.: (1/4)*exp(3*x)*(4*cosh(2*sqrt(2)*x) + 5*sqrt(2)*sinh(2*sqrt(2)*x)). - _Stefano Spezia_, Jan 27 2020
%e A054488 8 = a(1) = sqrt((A077240(1)^2 - 17)/8) = sqrt((23^2 - 17)/8)= sqrt(64) = 8.
%p A054488 a[0]:=1: a[1]:=8: for n from 2 to 26 do a[n]:=6*a[n-1]-a[n-2] od: seq(a[n], n=0..20); # _Zerinvary Lajos_, Jul 26 2006
%t A054488 LinearRecurrence[{6,-1},{1,8},30] (* _Harvey P. Dale_, Oct 09 2017 *)
%t A054488 Table[(LucasL[2*n+1, 2] + Fibonacci[2*n, 2])/2, {n,0,30}] (* _G. C. Greubel_, Jan 19 2020 *)
%o A054488 (PARI) my(x='x+O('x^30)); Vec((1+2*x)/(1-6*x+x^2)) \\ _G. C. Greubel_, Jan 19 2020
%o A054488 (PARI) apply( {A054488(n)=[1,8]*([0,-1;1,6]^n)[,1]}, [0..30]) \\ _M. F. Hasler_, Feb 27 2020
%o A054488 (Magma) I:=[1,8]; [n le 2 select I[n] else 6*Self(n-1) - Self(n-2): n in [1..30]]; // _G. C. Greubel_, Jan 19 2020
%o A054488 (Magma) R<x>:=PowerSeriesRing(Integers(), 21); Coefficients(R!( (1+2*x)/(1-6*x+x^2))); // _Marius A. Burtea_, Jan 20 2020
%o A054488 (Sage) [(lucas_number2(2*n+1,2,-1) + lucas_number1(2*n,2,-1))/2 for n in (0..30)] # _G. C. Greubel_, Jan 19 2020
%o A054488 (GAP) a:=[1,8];; for n in [3..30] do a[n]:=6*a[n-1]-a[n-2]; od; a; # _G. C. Greubel_, Jan 19 2020
%Y A054488 Cf. A000129, A002203, A002315, A038761, A077239, A077240, A077413.
%Y A054488 Cf. A077241 (even and odd parts).
%K A054488 easy,nonn
%O A054488 0,2
%A A054488 _Barry E. Williams_, May 04 2000
%E A054488 More terms from _James Sellers_, May 05 2000
%E A054488 Chebyshev comments from _Wolfdieter Lang_, Nov 08 2002