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 A077236 #41 Jan 01 2024 11:05:31 %S A077236 4,11,40,149,556,2075,7744,28901,107860,402539,1502296,5606645, %T A077236 20924284,78090491,291437680,1087660229,4059203236,15149152715, %U A077236 56537407624,211000477781,787464503500,2938857536219,10967965641376 %N A077236 a(n) = 4*a(n-1) - a(n-2) with a(0) = 4 and a(1) = 11. %C A077236 a(n)^2 - 3*b(n)^2 = 13, with the companion sequence b(n)= A054491(n). %C A077236 Bisection (even part) of Chebyshev sequence with Diophantine property. %C A077236 The odd part is A077235(n) with Diophantine companion A077234(n). %H A077236 Luigi Cerlienco, Maurice Mignotte, and F. Piras, <a href="http://dx.doi.org/10.5169/seals-87887">Suites récurrentes linéaires: Propriétés algébriques et arithmétiques</a>, L'Enseignement Math., 33 (1987), 67-108. See Example 2, page 93. %H A077236 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a> %H A077236 <a href="/index/Ch#Cheby">Index entries for sequences related to Chebyshev polynomials.</a> %H A077236 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (4,-1). %F A077236 a(n) = T(n+1,2) + 2*T(n,2), with T(n,x) Chebyshev's polynomials of the first kind, A053120. T(n,2) = A001075(n). %F A077236 G.f.: (4-5*x)/(1-4*x+x^2). %F A077236 From Al Hakanson (hawkuu(AT)gmail.com), Jul 06 2009: (Start) %F A077236 a(n) = ((4+sqrt(3))*(2+sqrt(3))^n + (4-sqrt(3))*(2-sqrt(3))^n)/2. Offset 0. %F A077236 a(n) = second binomial transform of 4,3,12,9,36. (End) %F A077236 a(n) = (A054491(n+1) - A054491(n-1))/2 = sqrt(3*A054491(n-1)*A054491(n+1) + 52), n >= 1. - _Klaus Purath_, Oct 12 2021 %e A077236 11 = a(1) = sqrt(3*A054491(1)^2 + 13) = sqrt(3*6^2 + 13)= sqrt(121) = 11. %t A077236 CoefficientList[Series[(4-5*x)/(1-4*x+x^2), {x,0,20}], x] (* or *) LinearRecurrence[{4,-1}, {4,11}, 30] (* _G. C. Greubel_, Apr 28 2019 *) %o A077236 (PARI) my(x='x+O('x^30)); Vec((4-5*x)/(1-4*x+x^2)) \\ _G. C. Greubel_, Apr 28 2019 %o A077236 (PARI) a(n) = polchebyshev(n+1, 1, 2) + 2*polchebyshev(n, 1, 2); \\ _Michel Marcus_, Oct 13 2021 %o A077236 (Magma) R<x>:=PowerSeriesRing(Integers(), 30); Coefficients(R!( (4-5*x)/(1-4*x+x^2) )); // _G. C. Greubel_, Apr 28 2019 %o A077236 (Sage) ((4-5*x)/(1-4*x+x^2)).series(x, 30).coefficients(x, sparse=False) # _G. C. Greubel_, Apr 28 2019 %o A077236 (GAP) a:=[4,11];; for n in [3..30] do a[n]:=4*a[n-1]-a[n-2]; od; a; # _G. C. Greubel_, Apr 28 2019 %Y A077236 Cf. A077238 (even and odd parts), A077235, A053120. %K A077236 nonn,easy %O A077236 0,1 %A A077236 _Wolfdieter Lang_, Nov 08 2002 %E A077236 Edited by _N. J. A. Sloane_, Sep 07 2018, replacing old definition with simple formula from _Philippe Deléham_, Nov 16 2008