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 A070503 #31 Dec 18 2023 15:06:48
%S A070503 0,1,8,27,23,2,11,15,20,32,16,19,6,24,38,13,37,34,10,12,5,36,29,31,7,
%T A070503 4,28,3,17,35,22,25,9,21,26,30,39,18,14,33,40,0,1,8,27,23,2,11,15,20,
%U A070503 32,16,19,6,24,38,13,37,34,10,12,5,36,29,31,7,4,28,3,17,35,22,25,9,21,26
%N A070503 a(n) = n^3 mod 41.
%H A070503 G. C. Greubel, <a href="/A070503/b070503.txt">Table of n, a(n) for n = 0..1000</a>
%H A070503 <a href="/index/Rec#order_41">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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
%F A070503 a(n) = a(n-41). - _G. C. Greubel_, Mar 31 2016
%t A070503 Table[Mod[n^3, 41], {n, 0, 100}] (* _Vincenzo Librandi_, Jun 19 2014 *)
%t A070503 PowerMod[Range[0,100],3,41] (* _Harvey P. Dale_, Nov 11 2022 *)
%o A070503 (Sage) [power_mod(n,3,41) for n in range(0, 76)] # _Zerinvary Lajos_, Oct 30 2009
%o A070503 (Magma) [Modexp(n, 3, 41): n in [0..80]]; // _Vincenzo Librandi_, Mar 31 2016
%o A070503 (PARI) a(n)=n^3%41 \\ _Charles R Greathouse IV_, Apr 06 2016
%Y A070503 Cf. A008960.
%K A070503 nonn,easy
%O A070503 0,3
%A A070503 _N. J. A. Sloane_, May 12 2002