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 A154870 #20 Nov 20 2024 15:34:38
%S A154870 7,5,1,-7,-5,-1,7,5,1,-7,-5,-1,7,5,1,-7,-5,-1,7,5,1,-7,-5,-1,7,5,1,-7,
%T A154870 -5,-1,7,5,1,-7,-5,-1,7,5,1,-7,-5,-1,7,5,1,-7,-5,-1,7,5,1,-7,-5,-1,7,
%U A154870 5,1,-7,-5,-1,7,5,1,-7,-5,-1,7,5,1,-7,-5,-1,7,5,1,-7,-5,-1,7,5,1,-7,-5,-1,7,5,1
%N A154870 Period 6: repeat [7, 5, 1, -7, -5, -1].
%C A154870 The sequence b(n) = (-A153130(n)) mod 9 = A153130(n+3) = A146501(n-1) = 8, 7, 5, 1, 2, 4,... has period length 6. This here is a(n)=b(n)-A153130(n).
%C A154870 a(n) is (-1)^(n+1) * numerator of F(n) where F(n) = f(F(n-1)) starting from F(0) = -7/4 and step f(z) = z^2 -29/16. - _Nicolas Bělohoubek_, Nov 20 2024
%H A154870 Holly Krieger and Brady Haran, <a href="https://www.youtube.com/watch?v=N92w4e-hrA4">A Fascinating Thing about Fractions</a>, Numberphile video, Dec 15 2019.
%H A154870 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,-1).
%F A154870 a(n) = -a(n-3) for n>2; G.f.: (7+5*x+x^2)/((1+x)*(1-x+x^2)). [_R. J. Mathar_, Jan 23 2009]
%F A154870 a(n) = cos(n*Pi) + 6*cos(n*Pi/3) + 2*sqrt(3)*sin(n*Pi/3). - _Wesley Ivan Hurt_, Jun 20 2016
%p A154870 A154870:=n->[7, 5, 1, -7, -5, -1][(n mod 6)+1]: seq(A154870(n), n=0..100); # _Wesley Ivan Hurt_, Jun 20 2016
%t A154870 PadRight[{}, 100, {7, 5, 1, -7, -5, -1}] (* _Wesley Ivan Hurt_, Jun 20 2016 *)
%o A154870 (Magma) &cat [[7, 5, 1, -7, -5, -1]^^20]; // _Wesley Ivan Hurt_, Jun 20 2016
%Y A154870 Cf. A146501, A153130.
%K A154870 sign,easy
%O A154870 0,1
%A A154870 _Paul Curtz_, Jan 16 2009
%E A154870 Edited and extended by _R. J. Mathar_, Jan 23 2009