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 A070463 #15 Dec 18 2023 13:07:48
%S A070463 0,1,4,9,16,25,36,8,23,40,18,39,21,5,32,20,10,2,37,33,31,31,33,37,2,
%T A070463 10,20,32,5,21,39,18,40,23,8,36,25,16,9,4,1,0,1,4,9,16,25,36,8,23,40,
%U A070463 18,39,21,5,32,20,10,2,37,33,31,31,33,37,2,10,20,32,5,21,39,18,40,23,8,36
%N A070463 a(n) = n^2 mod 41.
%H A070463 G. C. Greubel, <a href="/A070463/b070463.txt">Table of n, a(n) for n = 0..1000</a>
%H A070463 <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 A070463 a(n) = a(n-41). - _G. C. Greubel_, Mar 25 2016
%t A070463 Table[Mod[n^2,41],{n,0,200}] (* _Vladimir Joseph Stephan Orlovsky_, Apr 27 2011 *)
%t A070463 PowerMod[Range[0,80],2,41] (* _Harvey P. Dale_, Apr 06 2019 *)
%o A070463 (PARI) a(n)=n^2%41 \\ _Charles R Greathouse IV_, Apr 06 2016
%Y A070463 Cf. A070461, A070462.
%K A070463 nonn,easy
%O A070463 0,3
%A A070463 _N. J. A. Sloane_, May 12 2002