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 A070472 #36 Dec 14 2023 05:12:25
%S A070472 0,1,1,6,1,6,6,0,1,1,6,1,6,6,0,1,1,6,1,6,6,0,1,1,6,1,6,6,0,1,1,6,1,6,
%T A070472 6,0,1,1,6,1,6,6,0,1,1,6,1,6,6,0,1,1,6,1,6,6,0,1,1,6,1,6,6,0,1,1,6,1,
%U A070472 6,6,0,1,1,6,1,6,6,0,1,1,6,1,6,6,0,1,1,6,1,6,6,0,1,1,6,1,6,6,0,1,1
%N A070472 a(n) = n^3 mod 7.
%C A070472 Periodic with period 7.
%H A070472 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 1).
%F A070472 a(n) = a(n-7).
%F A070472 G.f.: x*(1 + x + 6*x^2 + x^3 + 6*x^4 + 6*x^5)/(1-x^7). - _Vincenzo Librandi_, Mar 27 2016
%t A070472 PowerMod[Range[0,120],3,7] (* or *) LinearRecurrence[{0,0,0,0,0,0,1},{0,1,1,6,1,6,6},120] (* or *) PadRight[{},120,{0,1,1,6,1,6,6}] (* _Harvey P. Dale_, Nov 29 2013 *)
%o A070472 (Sage) [power_mod(n,3,7 ) for n in range(0, 101)] # _Zerinvary Lajos_, Oct 29 2009
%o A070472 (Magma) [Modexp(n, 3, 7 ): n in [0..100]]; // _Vincenzo Librandi_, Mar 27 2016
%o A070472 (PARI) a(n)=n^3%7 \\ _Charles R Greathouse IV_, Apr 06 2016
%K A070472 nonn,easy
%O A070472 0,4
%A A070472 _N. J. A. Sloane_, May 12 2002