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 A159668 #52 Feb 16 2024 06:33:30
%S A159668 1,27,755,21113,590409,16510339,461699083,12911063985,361048092497,
%T A159668 10096435525931,282339146633571,7895399670214057,220788851619360025,
%U A159668 6174192445671866643,172656599627192905979,4828210597115729500769,135017240119613233115553
%N A159668 Expansion of (1 - x)/(1 - 28*x + x^2).
%C A159668 Previous name was: The general form of the recurrences are the a(j), b(j) and n(j) solutions of the 2 equations problem: 13*n(j) + 1 = a(j)*a(j) and 15*n(j) + 1 = b(j)*b(j) with positive integer numbers.
%C A159668 Positive values of x (or y) satisfying x^2 - 28*x*y + y^2 + 26 = 0. - _Colin Barker_, Feb 23 2014
%H A159668 Vincenzo Librandi, <a href="/A159668/b159668.txt">Table of n, a(n) for n = 0..199</a>
%H A159668 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (28,-1).
%F A159668 G.f.: (1 - x)/(1 - 28*x + x^2).
%F A159668 The a(j) recurrence is a(0)=1, a(1)=27, a(t+2) = 28*a(t+1) - a(t) resulting in terms 1, 27, 755, 21113, ... (this sequence).
%F A159668 The b(j) recurrence is b(0)=1, b(1)=29, b(t+2) = 28*b(t+1) - b(t) resulting in terms 1, 29, 811, 22679, ... (A159669).
%F A159668 The n(j) recurrence is n(0) = n(1) = 0, n(2) = 56, n(t+3) = 783*(n(t+2) -n(t+1)) + n(t) resulting in terms 0, 0, 56, 43848, 34289136, ... (A159673).
%F A159668 a(n) = (1/30)*(15-sqrt(195))*(1+(14+sqrt(195))^(2*n+1))/(14+sqrt(195))^n. - _Bruno Berselli_, Feb 25 2014
%F A159668 a(n) = 28*a(n-1) - a(n-2), a(0)=1, a(1)=27. - _Harvey P. Dale_, Apr 09 2014
%F A159668 a(n) = A097311(n) - A097311(n-1). - _G. C. Greubel_, Sep 26 2022
%p A159668 for a from 1 by 2 to 100000 do b:=sqrt((15*a*a-2)/13): if (trunc(b)=b) then
%p A159668 n:=(a*a-1)/13: La:=[op(La),a]:Lb:=[op(Lb),b]:Ln:=[op(Ln),n]: endif: enddo:
%p A159668 # Second program
%p A159668 seq(simplify(ChebyshevU(n,14) -ChebyshevU(n-1,14)), n=0..40); # _G. C. Greubel_, Sep 26 2022
%t A159668 CoefficientList[Series[(1-x)/(1-28x+x^2), {x,0,40}], x] (* _Vincenzo Librandi_, Feb 25 2014 *)
%t A159668 LinearRecurrence[{28,-1},{1,27},40] (* _Harvey P. Dale_, Apr 09 2014 *)
%o A159668 (PARI) Vec((-x+1)/(x^2-28*x+1) + O(x^100)) \\ _Colin Barker_, Feb 23 2014
%o A159668 (Magma) [n le 2 select 27^(n-1) else 28*Self(n-1)-Self(n-2): n in [1..20]]; // _Vincenzo Librandi_, Feb 25 2014
%o A159668 (SageMath)
%o A159668 def A159668(n): return chebyshev_U(n,14) - chebyshev_U(n-1,14)
%o A159668 [A159668(n) for n in range(40)] # _G. C. Greubel_, Sep 26 2022
%Y A159668 Cf. A097311, A157456, A159669, A159673.
%Y A159668 Cf. similar sequences listed in A238379.
%K A159668 nonn,easy
%O A159668 0,2
%A A159668 _Paul Weisenhorn_, Apr 19 2009
%E A159668 More terms from _Colin Barker_, Feb 23 2014
%E A159668 New name and offset changed to 0 from _Joerg Arndt_, Feb 23 2014