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 A070493 #26 Dec 18 2023 14:57:35
%S A070493 0,1,8,27,2,1,30,2,16,16,8,29,23,27,16,27,4,15,4,8,2,23,15,15,29,1,30,
%T A070493 29,4,23,30,0,1,8,27,2,1,30,2,16,16,8,29,23,27,16,27,4,15,4,8,2,23,15,
%U A070493 15,29,1,30,29,4,23,30,0,1,8,27,2,1,30,2,16,16,8,29,23,27,16,27,4,15,4
%N A070493 a(n) = n^3 mod 31.
%H A070493 G. C. Greubel, <a href="/A070493/b070493.txt">Table of n, a(n) for n = 0..1000</a>
%H A070493 <a href="/index/Rec#order_31">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
%F A070493 a(n) = a(n-31). - _G. C. Greubel_, Mar 30 2016
%t A070493 Table[Mod[n^3, 31], {n, 0, 100}] (* _Vincenzo Librandi_, Jun 19 2014 *)
%t A070493 PowerMod[Range[0,100],3,31] (* _Harvey P. Dale_, Apr 13 2015 *)
%o A070493 (Sage) [power_mod(n,3,31 )for n in range(0, 81)] # _Zerinvary Lajos_, Oct 30 2009
%o A070493 (Magma) [n^3 mod 31: n in [0..80]]; // _Vincenzo Librandi_, Jun 19 2014
%o A070493 (PARI) a(n)=n^3%31 \\ _Charles R Greathouse IV_, Apr 06 2016
%Y A070493 Cf. A008960.
%K A070493 nonn,easy
%O A070493 0,3
%A A070493 _N. J. A. Sloane_, May 12 2002