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 A109753 #22 Dec 14 2023 05:18:51
%S A109753 0,1,0,3,0,5,0,7,0,1,0,3,0,5,0,7,0,1,0,3,0,5,0,7,0,1,0,3,0,5,0,7,0,1,
%T A109753 0,3,0,5,0,7,0,1,0,3,0,5,0,7,0,1,0,3,0,5,0,7,0,1,0,3,0,5,0,7,0,1,0,3,
%U A109753 0,5,0,7,0,1,0,3,0,5,0,7,0,1,0,3,0,5,0,7,0,1,0,3,0,5,0,7,0,1,0,3,0,5,0,7,0
%N A109753 n^3 mod 8; the periodic sequence {0,1,0,3,0,5,0,7}.
%H A109753 <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 1).
%F A109753 G.f. = (x+3x^3+5x^5+7x^7)/(1-x^8)
%o A109753 (Sage) [power_mod(n,3,8 ) for n in range(0, 105)] # - _Zerinvary Lajos_, Oct 29 2009
%o A109753 (PARI) a(n)=n^3%8 \\ _Charles R Greathouse IV_, Apr 06 2016
%Y A109753 Cf. n mod 8 = A010877; n^2 mod 8 = A070432.
%K A109753 easy,nonn
%O A109753 0,4
%A A109753 Bruce Corrigan (scentman(AT)myfamily.com), Aug 11 2005